Optimal rectangular partitions

DOI10.1002/NET.10058MaRDI QIDQ4797949zbMATH OpenOpenAlexFDO

Authors Felipe C. Calheiros, Abilio Lucena, Cid Carvalho de Souza

Publication date 10 March 2003

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.10058

zbMATH Keywords

cutting planesLagrangian relaxationrectangular partitionsoptimality properties

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• EXACT SOLUTIONS OF RECTANGULAR PARTITIONS VIA INTEGER PROGRAMMING
• On rectilinear partitions with minimum stabbing number
• Improved bounds for rectangular and guillotine partitions
• On heuristics for minimum length rectilinear partitions
• Minimum stabbing rectangular partitions of rectilinear polygons

Cited in

(17)

• A relax-and-cut algorithm for the set partitioning problem
• Exact algorithms for the vertex separator problem in graphs
• On the number of rectangulations of a planar point set
• Improved bounds for rectangular and guillotine partitions
• On rectangular covering problems
• On optimal guillotine partitions approximating optimal \(d\)-box partitions
• The structure of optimal partitions of orthogonal polygons into fat rectangles
• Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations
• EXACT SOLUTIONS OF RECTANGULAR PARTITIONS VIA INTEGER PROGRAMMING
• A relax-and-cut framework for large-scale maximum weight connected subgraph problems
• Optimal sectionalization of a trellis
• Optimal matrix-segmentation by rectangles
• Non delayed relax-and-cut algorithms
• Stronger K-tree relaxations for the vehicle routing problem
• Minimum stabbing rectangular partitions of rectilinear polygons
• On three soft rectangle packing problems with guillotine constraints
• Decomposition and dynamic cut generation in integer linear programming

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: Optimal rectangular partitions

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