Isbn: 9781332274345 - partitioning algorithms for a class of knapsack problems (classic reprint) (3 resultados)

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

Paperback. Condición: 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.…