MPQ-trees for orthogonal packing problem
From MaRDI portal
Publication:2883589
DOI10.1016/J.ENDM.2010.05.054zbMATH Open1237.90003OpenAlexW2089327004MaRDI QIDQ2883589FDOQ2883589
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
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
Combinatorial optimization (90C27) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Cites Work
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
- On the two-dimensional knapsack problem
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
- A new exact method for the two-dimensional orthogonal packing problem
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- A new constraint programming approach for the orthogonal packing problem
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- Title not available (Why is that?)
Cited In (8)
- Exact solution techniques for two-dimensional cutting and packing
- MRP, tree properties and square principles
- Consecutive ones matrices for multi-dimensional orthogonal packing problems
- A new constraint programming approach for the orthogonal packing problem
- LP bounds in an interval-graph algorithm for orthogonal-packing feasibility
- A SAT encoding for multi-dimensional packing problems
- MPQ-trees for the orthogonal packing problem
- Rectangle packing with additional restrictions
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)
