Solving quadratic assignment problems with rectangular distances and integer programming

DOI10.1002/nav.3800230407zbMath0377.90091OpenAlexW2091151788MaRDI QIDQ4156163

Love, Robert F., Jsun Y. Wong

Publication date: 1976

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800230407

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items

The facility layout problem, A survey for the quadratic assignment problem, Exact and heuristic procedures for the material handling circular flow path design problem, Expected part delays as a secondary layout criterion in automated manufacturing systems, A heuristic procedure for the single-row facility layout problem, Exact algorithms for the solution of the grey pattern quadratic assignment problem, A new model for robust facility layout problem, Recent models and techniques for solving the layout problem, An efficient, effective, and robust decoding heuristic for metaheuristics-based layout optimization, Efficient models for the facility layout problem

Cites Work

• Practical Solution of Large Mixed Integer Programming Problems with Umpire
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey
• A Nonlinear Approximation Method for Solving a Generalized Rectangular Distance Weber Problem