The following pages link to Optimal rectangular partitions (Q4797949):
Displaying 17 items.
- The structure of optimal partitions of orthogonal polygons into fat rectangles (Q598555) (← links)
- Non delayed relax-and-cut algorithms (Q817212) (← links)
- Improved bounds for rectangular and guillotine partitions (Q1123613) (← links)
- On optimal guillotine partitions approximating optimal \(d\)-box partitions (Q1327171) (← links)
- Minimum stabbing rectangular partitions of rectilinear polygons (Q1652208) (← links)
- A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399) (← links)
- Stronger \(K\)-tree relaxations for the vehicle routing problem (Q1827647) (← links)
- Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations (Q1953524) (← links)
- On three soft rectangle packing problems with guillotine constraints (Q2423793) (← links)
- A relax-and-cut algorithm for the set partitioning problem (Q2462542) (← links)
- Decomposition and dynamic cut generation in integer linear programming (Q2490337) (← links)
- On the number of rectangulations of a planar point set (Q2500619) (← links)
- Exact algorithms for the vertex separator problem in graphs (Q3008917) (← links)
- ON RECTANGULAR COVERING PROBLEMS (Q3401889) (← links)
- EXACT SOLUTIONS OF RECTANGULAR PARTITIONS VIA INTEGER PROGRAMMING (Q4762911) (← links)
- Optimal sectionalization of a trellis (Q4887051) (← links)
- Optimal matrix-segmentation by rectangles (Q5902115) (← links)
