EXACT SOLUTIONS OF RECTANGULAR PARTITIONS VIA INTEGER PROGRAMMING

DOI10.1142/S0218195900000280zbMath0981.90046OpenAlexW2129423814MaRDI QIDQ4762911

Cláudio N. de Meneses, Cid Carvalho De Souza

Publication date: 22 February 2001

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195900000280

zbMATH Keywords

integer programmingbranch-and-cutbranch-and-pricepolyhedral combinatoricsrectangular partition

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items

Partitions of rectilinear polygons with minimum stabbing number ⋮ Minimum stabbing rectangular partitions of rectilinear polygons ⋮ Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations ⋮ Non delayed relax-and-cut algorithms

Uses Software

• MINTO

Cites Work

• Improved bounds for rectangular and guillotine partitions
• Approximation algorithms for partitioning a rectangle with interior points
• On optimal guillotine partitions approximating optimal \(d\)-box partitions
• AN EFFICIENT DIVIDE-AND-CONQUER APPROXIMATION ALGORITHM FOR PARTITIONING INTO D-BOXES