A New Mathematical-Programming Framework for Facility-Layout Design

References

• Anjos M. F. New convex relaxations for the maximum cut and VLSI layout problems. (2001) . Ph.D. thesis, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, CanadaGoogle Scholar
• Anjos M. F., Vannelli A. An attractor-repeller approach to floorplanning. Math. Methods Oper. Res. (2002) 56:3–27Crossref, Google Scholar
• Anstreicher K., Brixius N., Goux J.-P., Linderoth J. Solving large quadratic assignment problems on computational grids. Math. Programming Ser. B (2002) 91:563–588Crossref, Google Scholar
• Armour G., Buffa E. A heuristic algorithm and simulation approach to relative location of facilities. Management Sci. (1963) 9:294–309Link, Google Scholar
• Balas E. Disjunctive programming: Properties of the convex hull of feasible points. Discrete Appl. Math. (1998) 89:3–44Crossref, Google Scholar
• Brooke A., Kendrick D., Meeraus A.GAMS—A User's Guide, Release 2.25 (1992) (The Scientific Press, South San Francisco, CA) Google Scholar
• Ceria S., Soares J. Convex programming for disjunctive convex optimization. Math. Programming Ser. A (1999) 86:595–614Crossref, Google Scholar
• Drezner Z. DISCON: A new method for the layout problem. Oper. Res. (1980) 28:1375–1384Link, Google Scholar
• Ferris M. C., Pang J. S. Engineering and economic applications of complementarity problems. SIAM Rev. (1997) 39:669–713Crossref, Google Scholar
• Fletcher R., Leyffer S. Numerical experience with solving MPECs as NLPs. (2002) . Technical report NA\210, University of Dundee, Dundee, ScotlandGoogle Scholar
• Foulds L.Graph Theory Applications (1991) (Springer Verlag, New York) Google Scholar
• Huntley C., Brown D. A parallel heuristic for quadratic assignment problems. Comput. Oper. Res. (1991) 18:275–289Crossref, Google Scholar
• Luo Z.-Q., Pang J.-S., Ralph D.Mathematical Programs with Equilibrium Constraints (1996) (Cambridge University Press, Cambridge, UK) Crossref, Google Scholar
• Mavridou T., Pardalos P. Simulated annealing and genetic algorithms for the facility layout problem: A survey. Comput. Optim. Appl. (1997) 7:111–126Crossref, Google Scholar
• Meller R., Gau K.-Y. The facility layout problem: Recent and emerging trends and perspectives. J. Manufacturing Systems (1996) 15:351–366Crossref, Google Scholar
• Meller R., Narayanan V., Vance P. Optimal facility layout design. Oper. Res. Lett. (1998) 23:117–127Crossref, Google Scholar
• Montreuil B., White J., Pence I. A modelling framework for integrating layout design and flow network design. Progress in Material Handling and Logistics (1991) Vol. 2(Springer-Verlag, Heidelberg, Germany) 95–116Crossref, Google Scholar
• Murtagh B., Saunders M. Large-scale linearly constrained optimization. Math. Programming (1978) 14:41–72Crossref, Google Scholar
• Murtagh B., Saunders M. A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints. Math. Programming Stud. (1982) 16:84–117Crossref, Google Scholar
• Murtagh B., Saunders M. MINOS 5.1 User's Guide. (1987) . Technical Report SOL 83-20R, Department of Operations Research, Stanford University, Stanford, CAGoogle Scholar
• Nesterov Y., Nemirovskii A.Interior-Point Polynomial Algorithms in Convex Programming (1994) (SIAM, Philadelphia, PA) Crossref, Google Scholar
• Pardalos P., Wolkowicz H.Quadratic Assignment and Related Problems (1994) (American Mathematical Society, Providence, RI) Crossref, Google Scholar
• Scriabin M., Vergin R. Comparison of computer algorithms and visual based methods for plant layout. Management Sci. (1975) 22:172–181Link, Google Scholar
• Sherali H., Fraticelli B., Meller R. Enhanced model formulations for optimal facility layout. Oper. Res. (2003) 51:629–644Link, Google Scholar
• Tate D., Smith A. Unequal-area facility layout by genetic search. IIE Trans. (1995) 27:465–472Crossref, Google Scholar
• van Camp D., Carter M., Vannelli A. A nonlinear optimization approach for solving facility layout problems. Eur. J. Oper. Res. (1991) 57:174–189Crossref, Google Scholar
• Wright S.Primal-Dual Interior-Point Methods (1997) (SIAM, Philadelphia, PA) Crossref, Google Scholar