Exact solutions of rectangular partitions via integer programming

International Journal of Computational Geometry and Applications

Volumn 10, Issue 5, 2000, Pages 477-522

  De Meneses, Cláudio N ^a   De Souza, Cid C ^a  

^a UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

Branch and cut; Branch and price; Polyhedral combinatorics; Rectangular partition

Indexed keywords

EID: 0034360662     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195900000280     Document Type: Article

References (15)

1. CPLEX Optimization, Inc. Using the CPLEX Callable Library. Manual, 1994.
2. D. Z Du, L. Q. Pan, and M. T. Shing. Minimum Edge Length Guillotine Rectangular Partition. Technical report, Mathematical Sciences Research Institute, University of California, Jan. 1986.
3. T. F. Gonzalez, M. Razzazi, M. T. Shing, and S. Q. Zheng. On Optimal Guillotine Partitions Approximating Optimal d-Box Partitions. Computational Geometry, 4:1-11, 1994.
4. T. F. Gonzalez, M. Razzazi, and S. Q. Zheng. An Efficient Divide-and-Conquer Approximation Algorithm for Partitioning into d-boxes. International Journal of Computational Geometry and Applications, 3(4):281-287, 1993.
5. T. F. Gonzalez and S. Q. Zheng. Bounds for Partitioning Rectilinear Polygons. Proc. Symp. Computacional Geometry, pages 281-287, June 1985.
6. T. F. Gonzalez and S. Q. Zheng. Improved Bounds for Rectangular and Guillotine Partitions. J. Symbolic Computation, 7:591-610, 1989.
7. T. F. Gonzalez and S. Q. Zheng. Approximation Algorithms for Partitioning a Rectangle with Interior Points. Algorithmica, 5:11-42, 1990.
8. M. Jünger, G. Reinelt, and S. Thienel. Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization. Technical report, Institut für Informatik, Universität zu Köln, 1994.
9. C. Levcopoulos. Fast Heuristics for Minimum Length Rectangular Partitions of Polygons. Proceedings of the 2nd Computational Geometry Conference, June 1986.
10. A. Lingas, R.Y. Pinter, R.L. Rivest, and A. Shamir. Minimum Edge Length Partitioning of Rectlinear Polygons. In Proceedings of the 20th Annual Allerton Conference Communication, Control, and Computing. University of Illinois, 1982.
11. G. L. Nemhauser and L. A. Wolsey. Integer and Combinatorial Optimization. John Wiley & Sons, 1988.
12. R. Rivest. The PI (Placement and Interconnect) System. In Proceedings of 19th Design Automation Conference, June 1982.
13. D. M. Ryan and B. A. Foster. An Integer Programming Approach to Scheduling. A. Wren (ed.) Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, North-Holland, Amsterdam, pages 269-280, 1981.
14. M. W. P. Savelsbergh and G. L. Nemhauser. Functional Description of MINTO, a Mixed INTeger Optimizer. Manual version 2.3, 1996.
15. L. A. Wolsey. Integer Programming. John Willey and Sons, 1998.