Heuristic placement routines for two-dimensional bin packing problem

MaRDI QIDQ5189293zbMATH OpenFDO

Authors

Publication date 15 March 2010

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

zbMATH Keywords

bin packing problemcutting and packingheuristic placement

Mathematics Subject Classification ID

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

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

Cited in

(7)

• Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
• Heuristics for packing semifluids
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
• scientific article; zbMATH DE number 5911854 (Why is no real title available?)
• Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
• scientific article; zbMATH DE number 1336411 (Why is no real title available?)
• Two heuristics for the label printing problem

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)