A semidefinite optimization approach for the single-row layout problem with unequal dimensions

Discrete Optimization

Volumn 2, Issue 2, 2005, Pages 113-122

  Anjos, Miguel F ^a,b   Kennings, Andrew ^b   Vannelli, Anthony ^b  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Combinatorial optimization; Facilities planning and design; Global optimization; Semidefinite optimization; Space allocation

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; HEURISTIC METHODS; LINEARIZATION; PROBLEM SOLVING; RELAXATION PROCESSES;

COMBINATORIAL OPTIMIZATION; FACILITIES PLANNING AND DESIGN; SEMIDEFINITE OPTIMIZATION; SPACE ALLOCATION;

GLOBAL OPTIMIZATION;

EID: 22644442762     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2005.03.001     Document Type: Article

References (32)

1. D. Adolphson, and T.C. Hu Optimal linear ordering SIAM J. Appl. Math. 25 1973 403 423
2. M.F. Anjos, and H. Wolkowicz Semidefinite programming for discrete optimization and matrix completion problems Discrete Appl. Math. 123 1-2 2002 513 577
3. K. Anstreicher, N. Brixius, J.-P. Goux, and J. Linderoth Solving large quadratic assignment problems on computational grids Math. Programming 91 3, Ser. B 2002 563 588
4. S.J. Benson, Y. Ye, and X. Zhang Solving large-scale sparse semidefinite programs for combinatorial optimization SIAM J. Optim. 10 2 2000 443 461 (electronic)
5. S. Burer Semidefinite programming in the space of partial positive semidefinite matrices. SIAM J. Optim. 14 1 2003 139 172 (electronic)
6. M. Fukuda, M. Kojima, K. Murota, and K. Nakata Exploiting sparsity in semidefinite programming via matrix completion, I: general framework SIAM J. Optim. 11 3 2000/01 647 674 (electronic)
7. M.X. Goemans, and D.P. Williamson Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming J. Assoc. Comput. Mach. 42 6 1995 1115 1145
8. M. Grötschel, M. Jünger, and G. Reinelt A cutting plane algorithm for the linear ordering problem Oper. Res. 32 6 1984 1195 1220
9. M. Grötschel, M. Jünger, and G. Reinelt Facets of the linear ordering polytope Math. Programming 33 1 1985 43 60
10. C. Helmberg, A cutting plane algorithm for large scale semidefinite relaxations, in: M. Grötschel (Ed.), The Sharpest Cut, MPS/SIAM Series of Optimization, SIAM, Philadelphia, PA, 2004, pp. 233-256.
11. C. Helmberg, and K.C. Kiwiel A spectral bundle method with bounds Math. Programming 93 2, Ser. A 2002 173 194
12. C. Helmberg, and F. Rendl A spectral bundle method for semidefinite programming SIAM J. Optim. 10 3 2000 673 696 (electronic)
13. S.S. Heragu, and A.S. Alfa Experimental analysis of simulated annealing based algorithms for the layout problem European J. Oper. Res. 57 2 1992 190 202
14. S.S. Heragu, and A. Kusiak Machine layout problem in flexible manufacturing systems Oper. Res. 36 2 1988 258 268
15. S.S. Heragu, and A. Kusiak Efficient models for the facility layout problem European J. Oper. Res. 53 1991 1 13
16. R.M. Karp, and M. Held Finite-state processes and dynamic programming SIAM J. Appl. Math. 15 1967 693 718
17. M. Kočvara, and M. Stingl PENNON: a code for convex nonlinear and semidefinite programming Optim. Methods Software 18 3 2003 317 333
18. M. Kočvara, M. Stingl, PENNON: a generalized augmented Lagrangian method for semidefinite programming, in: High Performance Algorithms and Software for Nonlinear Optimization (Erice, 2001), Applied Optimization, vol. 82, Kluwer Academic Publishers, Norwell, MA, 2003, pp. 303-321.
19. T.C. Koopmans, and M. Beckmann Assignment problems and the location of economic activities Econometrica 25 1957 53 76
20. K.R. Kumar, G.C. Hadjinicola, and T. Lin A heuristic procedure for the single-row facility layout problem European J. Oper. Res. 87 1 1995 65 73
21. M. Laurent, F. Rendl, Semidefinite programming and integer programming, in: G. Nemhauser, K. Aardal, R. Weismantel (Eds.), Handbook on Discrete Optimization, Elsevier, Amsterdam, to appear.
22. W. Liu, and A. Vannelli Generating lower bounds for the linear arrangement problem Discrete Appl. Math. 59 2 1995 137 151
23. R.F. Love, and J.Y. Wong On solving a one-dimensional space allocation problem with integer programming INFOR 14 2 1976 139 143
24. R.D. Meller, and K.-Y. Gau The facility layout problem: recent and emerging trends and perspectives J. Manufacturing Systems 15 5 1996 351 366
25. K. Nakata, K. Fujisawa, M. Fukuda, M. Kojima, and K. Murota Exploiting sparsity in semidefinite programming via matrix completion, II: implementation and numerical results Math. Programming 95 2003 303 327
26. J.-C. Picard, and M. Queyranne On the one-dimensional space allocation problem Oper. Res. 29 2 1981 371 391
27. G. Reinelt, The Linear Ordering Problem: Algorithms and Applications, Research and Exposition in Mathematics, vol. 8, Heldermann Verlag, Berlin, 1985.
28. D. Romero, and A. Sánchez-Flores Methods for the one-dimensional space allocation problem Comput. Oper. Res. 17 5 1990 465 473
29. D.M. Simmons One-dimensional space allocation: an ordering algorithm Oper. Res. 17 1969 812 826
30. K.C. Toh, M.J. Todd, and R.H. Tütüncü SDPT3 - a MATLAB software package for semidefinite programming, version 1.3 Optim. Methods Software 11/12 1-4 1999 545 581
31. H. Wolkowicz Solving semidefinite programs using preconditioned conjugate gradients Optim. Methods Software 19 6 2004 653 672
32. H. Wolkowicz, R. Saigal, L. Vandenberghe (Eds.), Handbook of Semidefinite Programming, Kluwer Academic Publishers, Boston, MA, 2000.