Complexity and approximation of an area packing problem

DOI10.1007/s11590-010-0246-2zbMath1257.90083OpenAlexW2117122256MaRDI QIDQ691403

Andrea Lodi, Silvano Martello, Gerhard J. Woeginger, Cor A. J. Hurkens, Michele Monaci

Publication date: 30 November 2012

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-010-0246-2

zbMATH Keywords

complexityapproximationworst case analysisarea packing

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items

Symmetry-breaking constraints for packing identical rectangles within polyhedra

Cites Work

• Unnamed Item
• On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems
• An approximation algorithm for sequential rectangle placement
• The Difference Between Consecutive Primes, II
• Scheduling with Deadlines and Loss Functions
• The number of primes in a short interval.