A Hybrid Optimization Framework for Cutting and Packing Problems
From MaRDI portal
Recommendations
- A hybrid algorithm for the non-Guillotine cutting problem
- A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
- A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
- A population heuristic for constrained two-dimensional non-guillotine cutting
Cited in
(10)- A hybrid algorithm for the non-Guillotine cutting problem
- Grids for cutting and packing problems: a study in the 2D knapsack problem
- A two-phase approach for single container loading with weakly heterogeneous boxes
- An improved typology of cutting and packing problems
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
- Scalability Analysis of a Novel Integer Programming Model to Deal with Energy Consumption in Heterogeneous Wireless Sensor Networks
- A Novel Optimization in Guillotine Cut Applied Reel of Steel
- The integrated cutting and packing heterogeneous precast beams multiperiod production planning problem
- An auxiliary hybrid heuristic approach for objective function design evaluation -- using train unit scheduling as an example
- Cutting and packing optimization. Problems modeling and solution methods.
This page was built for publication: A Hybrid Optimization Framework for Cutting and Packing Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3625009)