On the effectivity of gradient methods for cutting stock problems

DOI10.1007/BF01720710zbMath0813.90092MaRDI QIDQ1342431

Eberhard Girlich, Alexander G. Tarnowski

Publication date: 11 January 1995

Published in: OR Spektrum (Search for Journal in Brave)

zbMATH Keywords

greedy algorithmpackingtime complexityknapsackexact polynomial time algorithmworst case boundone, two and three dimensional cutting stock

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (1)

Constraints in container loading -- a state-of-the-art review

Cites Work

• The trim-loss and assortment problems: A survey
• A typology of cutting and packing problems
• Mathematical Methods of Organizing and Planning Production
• Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• The cutting stock problem and integer rounding
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• A Study of Composite Heuristic Algorithms
• A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
• An Algorithm for Two-Dimensional Cutting Problems
• Multistage Cutting Stock Problems of Two and More Dimensions
• Recursive Computational Procedure for Two-dimensional Stock Cutting
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the effectivity of gradient methods for cutting stock problems