Complexity results for the horizontal bar packing problem
From MaRDI portal
Publication:975490
DOI10.1016/J.IPL.2008.07.007zbMATH Open1191.68352OpenAlexW1976682037MaRDI QIDQ975490FDOQ975490
Authors: Fethi Jarray, Marie-Christine Costa, Christophe Picouleau 
Publication date: 9 June 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.07.007
Recommendations
- On the complexity of the {\(k\)}-packing function problem
- Complexity and approximation of an area packing problem
- Parameterized complexity of strip packing and minimum volume packing
- Hardness of approximation for strip packing
- Computational aspects of packing problems
- Complexity of one packing optimization problem
- Hardness results and approximation schemes for discrete packing and domination problems
- Optimizing some constructions with bars: new geometric knapsack problems
- scientific article; zbMATH DE number 1183280
- On the exact complexity of polyomino packing
Cites Work
- Discrete tomography. Foundations, algorithms, and applications
- Advances in discrete tomography and its applications. Some papers based on the presentations at the workshop on discrete tomography and its applications, New York, NY, USA, June 13--15, 2005.
- Reconstructing convex polyominoes from horizontal and vertical projections
- Combinatorial Properties of Matrices of Zeros and Ones
- Reconstruction of domino tiling from its two orthogonal projections
- Tiling with bars under tomographic constraints.
- An acyclic days-off scheduling problem
- Solving problems of discrete tomography application in workforce scheduling
Cited In (3)
This page was built for publication: Complexity results for the horizontal bar packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975490)
