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

John F. Pierce

Hardcover

ISBN 10: 0656610050 ISBN 13: 9780656610051

Publisher: Forgotten Books, 2018

Synopsis

Unlock the practical math behind cutting stock and packing problems.

This book explains how real-world packing and cutting tasks can be modeled as knapsack problems and solved with efficient algorithms. It shows how patterns, patterns generation, and multi‑stage cutting come together to minimize cost and waste.

• Learn how single- and multi-dimensional knapsack models translate into patterns for stock cutting and sheet layouts.
• See how guillotine-cutting ideas lead to practical strategies across two, three, or more stages.
• Compare dynamic programming approaches with combinatorial programming for evaluating knapsack functions.
• Understand how bounds, base solutions, and search procedures help solve large, complex planning problems.

Ideal for readers of operations research, industrial engineering, and optimization who want concrete methods, not just theory, to improve efficiency in cutting and packing tasks.

Edition details

• Publisher: Forgotten Books
• Publication date: 2018
• Language: English
• ISBN 10: 0656610050
• ISBN 13: 9780656610051
• Binding: Hardcover
• Number of pages: 101