Optimal rectangular partitions
From MaRDI portal
Publication:4797949
DOI10.1002/net.10058zbMath1035.90093OpenAlexW2106995649MaRDI QIDQ4797949
Abilio Lucena, Felipe C. Calheiros, 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
Related Items
Minimum stabbing rectangular partitions of rectilinear polygons ⋮ A relax-and-cut framework for large-scale maximum weight connected subgraph problems ⋮ Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations ⋮ A relax-and-cut algorithm for the set partitioning problem ⋮ Exact algorithms for the vertex separator problem in graphs ⋮ Decomposition and dynamic cut generation in integer linear programming ⋮ On the number of rectangulations of a planar point set ⋮ ON RECTANGULAR COVERING PROBLEMS ⋮ Stronger \(K\)-tree relaxations for the vehicle routing problem ⋮ Non delayed relax-and-cut algorithms
Uses Software
This page was built for publication: Optimal rectangular partitions