EXACT SOLUTIONS OF RECTANGULAR PARTITIONS VIA INTEGER PROGRAMMING

DOI10.1142/S0218195900000280MaRDI QIDQ4762911zbMATH OpenOpenAlexFDO

Authors 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

branch-and-cutbranch-and-priceinteger programmingpolyhedral combinatoricsrectangular partition

Mathematics Subject Classification ID

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

Recommendations

• Some efficiently solvable problems over integer partition polytopes
• Optimal rectangular partitions
• Application of regular partitions in integer programming
• scientific article; zbMATH DE number 808805
• Optimal integer partitions
• scientific article; zbMATH DE number 6469215
• Explicit solution of partitioning problems over a 1-dimensional parameter space
• scientific article; zbMATH DE number 3976788
• Partitioning a square into rectangles: NP-Completeness and approximation algorithms
• scientific article; zbMATH DE number 3679916

Cites work

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

Cited in

(8)

• Improved bounds for rectangular and guillotine partitions
• Minimum stabbing rectangular partitions of rectilinear polygons
• Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations
• Partitions of rectilinear polygons with minimum stabbing number
• Optimal rectangular partitions
• Rectangular partition is polynomial in two dimensions but NP-complete in three
• Non delayed relax-and-cut algorithms
• Solving the minimum convex partition of point sets with integer programming

Describes a project that uses

Uses Software

• MINTO

This page was built for publication: EXACT SOLUTIONS OF RECTANGULAR PARTITIONS VIA INTEGER PROGRAMMING

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4762911)