Heuristic placement routines for two-dimensional bin packing problem

zbMATH Open1190.90172MaRDI QIDQ5189293FDOQ5189293

Authors:

Publication date: 15 March 2010

Full work available at URL: http://www.scipub.org/scipub/back_issue.php?j_id=jms2

Recommendations

• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
• New resolution algorithm and pretreatments for the two-dimensional bin-packing problem
• Two-dimensional packing problems: a survey
• Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts

zbMATH Keywords

cutting and packingbin packing problemheuristic placement

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cited In (7)

• Title not available (Why is that?)
• Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
• Two heuristics for the label printing problem
• Heuristics for packing semifluids
• Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
• Title not available (Why is that?)
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers

This page was built for publication: Heuristic placement routines for two-dimensional bin packing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5189293)