MPQ-trees for the orthogonal packing problem
From MaRDI portal
Publication:1935724
DOI10.1007/s10852-011-9159-zzbMath1382.90111OpenAlexW1971800952MaRDI QIDQ1935724
Arnaud Pêcher, Petru Valicov, Cédric Joncour
Publication date: 19 February 2013
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-011-9159-z
Programming involving graphs or networks (90C35) Combinatorics in computer science (68R05) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- On the two-dimensional knapsack problem
- Incidence matrices and interval graphs
- A new constraint programming approach for the orthogonal packing problem
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- A new exact method for the two-dimensional orthogonal packing problem
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- A Characterization of Comparability Graphs and of Interval Graphs
This page was built for publication: MPQ-trees for the orthogonal packing problem
