Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes

INFORMS Journal on Computing

Volumn 20, Issue 4, 2008, Pages 611-617

  Anjos, Miguel F ^a   Vannelli, Anthony ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF GUELPH   (Canada)

Author keywords

Combinatorial optimization; Cutting planes; Semidefinite programming; Single row facility layout; Space allocation

Indexed keywords

EID: 57649191297     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1080.0270     Document Type: Article

References (26)

1. Amaral, A. R. S. 2006. On the exact solution of a facility layout problem. Eur. J. Oper. Res. 173 508-518.
2. Anjos, M. F. 2005. Semidefinite optimization approaches for satisfiability and maximum-satisfiability problems. J. Satisfiability, Boolean Model. Comput. 11-47.
3. Anjos, M. E, A. Vannelli. 2006. On the computational performance of a semidefinite programming approach to single row layout problems. Proc. Oper. Res. 2005, Springer-Verlag, Berlin, 277-282.
4. Anjos, M. E, H. Wolkowicz. 2002. Semidefinite programming for discrete optimization and matrix completion problems. Discrete Appl. Math. 123 513-577.
5. Anjos, M. E, A. Kennings, A. Vannelli. 2005. A semidefinite optimization approach for the single-row layout problem with unequal dimensions. Discrete Optim. 2 113-122.
6. Borchers, B, 1999. CSDP, a C library for semidefinite programming. Optim. Methods Software 11 613-623.
7. Çela, E. 1998. The Quadratic Assignment Problem, Combinatorial Optimization, Vol. 1. Kluwer Academic Publishers, Dordrecht, The Netherlands.
8. de Alvarenga, A. G., F. J. Negreiros-Gomes, M. Mestria. 2000. Meta- heuristic methods for a class of the facility layout problem. J. Intell. Manuf. 11 421-430.
9. de Klerk, E. 2002. Aspects of Semidefinite Programming, Applied Optimization, Vol. 65. Kluwer Academic Publishers, Dordrecht, The Netherlands.
10. Deza, M. M., M. Laurent. 1997. Geometry of Cuts and Metrics, Algorithms and Combinatorics, Vol. 15. Springer-Verlag, Berlin.
11. Goemans, M. X., D. P. Williamson. 1995. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. Assoc. Comput. Mach. 42 1115-1145.
12. Grötschel, M., M. Jünger, G. Reinelt. 1984. A cutting plane algorithm for the linear ordering problem. Oper. Res. 32 1195-1220.
13. Heragu, S. S., A. S. Alfa. 1992. Experimental analysis of simulated annealing based algorithms for the layout problem. Eur. J. Oper. Res. 57 190-202.
14. Heragu, S. S., A. Kusiak. 1988. Machine layout problem in flexible manufacturing systems. Oper. Res. 36 258-268.
15. Heragu, S. S., A. Kusiak. 1991. Efficient models for the facility layout problem. Eur. J. Oper. Res. 53 1-13.
16. Kumar, K. R., G. C. Hadjinicola, T. Lin. 1995. A heuristic procedure for the single-row facility layout problem. Eur. J. Oper. Res. 87 65-73.
17. Laurent, M., F. Rendl. 2005, Semidefinite programming and integer programming. K. Aardal, G. Nemhauser, R. Weismantel, eds. Handbook on Discrete Optimization. Elsevier, Amsterdam, 393-514.
18. Liu, W., A. Vannelli. 1995. Generating lower bounds for the linear arrangement problem. Discrete Appl. Math. 59 137-151.
19. Mitchell, J. E., B. Borchers. 2000. Solving linear ordering problems with a combined interior point/simplex cutting plane algorithm. H. Frenk, K. Roos, T. Terlaky, S. Zhang, eds. High Performance Optimization, Vol. 33. Kluwer Academic Publishers, Dordrecht, The Netherlands, 349-366.
20. Nugent, C. E., T. E. Vollmann, J. Ruml. 1968. An experimental comparison of techniques for the assignment of facilities to locations. Oper. Res. 16 150-173.
21. Picard, J.-C., M. Queyranne. 1981. On the one-dimensional space allocation problem. Oper. Res. 29 371-391.
22. Reinelt, G. 1985. The Linear Ordering Problem: Algorithms and Applications, Research and Exposition in Mathematics, Vol. 8. Heldermann Verlag, Berlin.
23. Romero, D., A. Sánchez-Flores. 1990. Methods for the one-dimensional space allocation problem. Comput. Oper. Res. 17 465-473.
24. Simmons, D. M. 1969. One-dimensional space allocation: An ordering algorithm. Oper. Res. 17 812-826.
25. Whaley, R., A. Petitet, J. Dongarra. 2001. Automated empirical optimizations of software and the ATLAS project. Parallel Comput. 27 3-35.
26. Wolkowicz, H., R. Saigal, L. Vandenberghe, eds. 2000. Handbook of Semidefinite Programming. Kluwer Academic Publishers, Boston.