Verwandte Artikel zu Partitioning Algorithms for a Class of Knapsack Problems...
Inhaltsangabe
Excerpt from Partitioning Algorithms for a Class of Knapsack Problems
In this paper algorithms are presented for evaluating the knapsack function for a class of two-dimensional knapsack problems such as arises, for example, in the solution of cutting stock problems in staged guillotine cutting operations. This class includes as a special case the classical one-dimensional knapsack problem. In each algorithm evaluation proceeds from the larger knapsack sizes to the smaller, exploiting for each size the optimality of all partitions or descendents of an optimal solution for a knapsack of that Size. All of the algorithms discussed are based on the methods of combinatorial programming and are reliable in the respect that if carried to completion they guarantee optimal evaluations for knapsacks.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reseña del editor
Excerpt from Partitioning Algorithms for a Class of Knapsack Problems
In this paper algorithms are presented for evaluating the knapsack function for a class of two-dimensional knapsack problems such as arises, for example, in the solution of cutting stock problems in staged guillotine cutting operations. This class includes as a special case the classical one-dimensional knapsack problem. In each algorithm evaluation proceeds from the larger knapsack sizes to the smaller, exploiting for each size the optimality of all partitions or descendents of an optimal solution for a knapsack of that Size. All of the algorithms discussed are based on the methods of combinatorial programming and are reliable in the respect that if carried to completion they guarantee optimal evaluations for knapsacks.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Neu kaufen
Diesen Artikel anzeigen
EUR 20,10
EUR 1,11 für den Versand von USA nach Deutschland
Versandziele, Kosten & DauerWeitere beliebte Ausgaben desselben Titels
Suchergebnisse für Partitioning Algorithms for a Class of Knapsack Problems...
Beispielbild für diese ISBN
Partitioning Algorithms for a Class of Knapsack Problems (Classic Reprint)
Anbieter: PBShop.store US, Wood Dale, IL, USA
Verkäuferbewertung 5 von 5 Sternen
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781332274345
Anzahl: 15 verfügbar
Beispielbild für diese ISBN
Partitioning Algorithms for a Class of Knapsack Problems (Classic Reprint)
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781332274345
Anzahl: 15 verfügbar
Foto des Verkäufers
Partitioning Algorithms for a Class of Knapsack Problems (Classic Reprint)
Print-on-DemandAnbieter: Forgotten Books, London, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: New. Print on Demand. This book explores the intricate world of knapsack problems, a fundamental concept in optimization theory that has far-reaching applications in various fields. The author delves into the historical roots of this problem, tracing its origins back to the work of Dantzig and Gilmore and Gomory. The book then examines the complexities of multi-dimensional knapsack problems, particularly those arising in cutting stock problems involving staged guillotine cutting operations. The author meticulously analyzes the theoretical underpinnings of knapsack problems, exploring the concept of optimal solutions and their descendents. He presents a range of algorithms designed to efficiently evaluate the knapsack function, including controlled interval search procedures and controlled parent-generation search procedures. Through a comprehensive exploration of these algorithms, the book sheds light on the efficiency and limitations of various approaches to solving knapsack problems. By providing a deep understanding of the intricacies of these problems, the book offers invaluable insights for researchers and practitioners working in fields such as operations research, computer science, and engineering. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Bestandsnummer des Verkäufers 9781332274345_0
Anzahl: Mehr als 20 verfügbar