Articoli correlati a Partitioning Algorithms for a Class of Knapsack Problems...

Partitioning Algorithms for a Class of Knapsack Problems (Classic Reprint) - Brossura

 
9781332274345: Partitioning Algorithms for a Class of Knapsack Problems (Classic Reprint)

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

EUR 1,91 per la spedizione da U.S.A. a Italia

Destinazione, tempi e costi

Risultati della ricerca per Partitioning Algorithms for a Class of Knapsack Problems...

Foto dell'editore

John F. Pierce
Editore: Forgotten Books, 2018
ISBN 10: 133227434X ISBN 13: 9781332274345
Nuovo PAP

Da: PBShop.store US, Wood Dale, IL, U.S.A.

Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332274345

Contatta il venditore

Compra nuovo

EUR 20,09
Convertire valuta
Spese di spedizione: EUR 1,91
Da: U.S.A. a: Italia
Destinazione, tempi e costi

Quantità: 15 disponibili

Aggiungi al carrello

Foto dell'editore

John F. Pierce
Editore: Forgotten Books, 2018
ISBN 10: 133227434X ISBN 13: 9781332274345
Nuovo PAP

Da: PBShop.store UK, Fairford, GLOS, Regno Unito

Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332274345

Contatta il venditore

Compra nuovo

EUR 18,82
Convertire valuta
Spese di spedizione: EUR 5,90
Da: Regno Unito a: Italia
Destinazione, tempi e costi

Quantità: 15 disponibili

Aggiungi al carrello

Immagini fornite dal venditore

John F. Pierce
Editore: Forgotten Books, 2018
ISBN 10: 133227434X ISBN 13: 9781332274345
Nuovo Paperback
Print on Demand

Da: Forgotten Books, London, Regno Unito

Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

Paperback. Condizione: 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. Codice articolo 9781332274345_0

Contatta il venditore

Compra nuovo

EUR 16,12
Convertire valuta
Spese di spedizione: EUR 11,70
Da: Regno Unito a: Italia
Destinazione, tempi e costi

Quantità: Più di 20 disponibili

Aggiungi al carrello