Consecutive ones matrices for multi-dimensional orthogonal packing problems
From MaRDI portal
Publication:5891542
DOI10.1016/j.endm.2010.05.042zbMath1237.90198MaRDI QIDQ5891542
Publication date: 13 May 2012
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-00652574/file/paperAlgoKPjmma.pdf
90C27: Combinatorial optimization
Cites Work
- 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 Algorithm for Two-Dimensional Cutting Problems
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing