MPQ-trees for orthogonal packing problem

DOI10.1016/j.endm.2010.05.054zbMath1237.90003MaRDI QIDQ2883589

Arnaud Pêcher, Petru Valicov, Cédric Joncour

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 graph; orthogonal packing problem; MP Q-tree

Mathematics Subject Classification ID

90C27: Combinatorial optimization

90-04: Software, source code, etc. for problems pertaining to operations research and mathematical programming

Related Items

Rectangle packing with additional restrictions

Cites Work

• 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
• 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