Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study

DOI10.1016/S0305-0548(03)00019-4zbMath1061.90094MaRDI QIDQ1433163

Mhand Hifi

Publication date: 15 June 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimization; cutting problems; exact algorithms; knapsack function

Mathematics Subject Classification ID

90C27: Combinatorial optimization

Related Items

On a hybrid genetic algorithm for solving the container loading problem with no orientation constraints, Manufacturer's mixed pallet design problem, An improved typology of cutting and packing problems

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• An and-or-graph approach for two-dimensional cutting problems
• A recursive exact algorithm for weighted two-dimensional cutting
• The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
• Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
• A comparative evaluation of heuristics for container loading
• Load planning for shipments of low density products
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• Dynamic, first-fit packings in two or more dimensions
• An Algorithm for Two-Dimensional Cutting Problems
• A Minimal Algorithm for the 0-1 Knapsack Problem
• Approximate algorithms for the container loading problem
• Multistage Cutting Stock Problems of Two and More Dimensions
• The Theory and Computation of Knapsack Functions
• Recursive Computational Procedure for Two-dimensional Stock Cutting
• A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems