MPQ-trees for orthogonal packing problem

DOI10.1016/J.ENDM.2010.05.054MaRDI QIDQ2883589zbMATHOpenAlexFDO

Authors C. Joncour, Arnaud Pêcher, Petru Valicov

Publication date 13 May 2012

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2010.05.054

zbMATH Keywords

interval graphorthogonal packing problemMP Q-tree

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Recommendations

• MPQ-trees for the orthogonal packing problem
• Efficient algorithms for orthogonal packing problems
• scientific article; zbMATH DE number 1183280
• Approximation algorithms for orthogonal packing problems for hypercubes
• A new constraint programming approach for the orthogonal packing problem
• An Exact Algorithm for Higher-Dimensional Orthogonal Packing
• LP bounds in various constraint programming approaches for orthogonal packing
• Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem
• Approximating the Orthogonal Knapsack Problem for Hypercubes
• A new search procedure for the two-dimensional orthogonal packing problem

Cites work

• scientific article; zbMATH DE number 3679885 (Why is no real title available?)
• A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
• A new constraint programming approach for the orthogonal packing problem
• A new exact method for the two-dimensional orthogonal packing problem
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• An Exact Algorithm for Higher-Dimensional Orthogonal Packing
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
• An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
• New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
• On the two-dimensional knapsack problem

Cited in

(8)

• MRP, tree properties and square principles
• A SAT encoding for multi-dimensional packing problems
• Exact solution techniques for two-dimensional cutting and packing
• MPQ-trees for the orthogonal packing problem
• Consecutive ones matrices for multi-dimensional orthogonal packing problems
• LP bounds in an interval-graph algorithm for orthogonal-packing feasibility
• Rectangle packing with additional restrictions
• A new constraint programming approach for the orthogonal packing problem

This page was built for publication: MPQ-trees for orthogonal packing problem

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