Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
From MaRDI portal
Recommendations
- Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
- Exact algorithms for large-scale unconstrained two and three staged cutting problems
- Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
Cites work
- scientific article; zbMATH DE number 4207563 (Why is no real title available?)
- A Minimal Algorithm for the 0-1 Knapsack Problem
- A comparative evaluation of heuristics for container loading
- A recursive exact algorithm for weighted two-dimensional cutting
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- An and-or-graph approach for two-dimensional cutting problems
- Approximate algorithms for the container loading problem
- Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
- Dynamic, first-fit packings in two or more dimensions
- Load planning for shipments of low density products
- Multistage Cutting Stock Problems of Two and More Dimensions
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
- The Theory and Computation of Knapsack Functions
Cited in
(15)- Exact algorithms for large-scale unconstrained two and three staged cutting problems
- An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts
- Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
- Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings
- Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem
- Constraints in container loading -- a state-of-the-art review
- Manufacturer's mixed pallet design problem
- On a hybrid genetic algorithm for solving the container loading problem with no orientation constraints
- Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
- An improved typology of cutting and packing problems
- Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups
- A two-phase constructive algorithm for the single container mix-loading problem
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
- Exact and overapproximated guarantees for corner cutting avoidance in a multiobstacle environment
- Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
This page was built for publication: Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1433163)
