A distance assignment approach to the facility layout problem
From MaRDI portal
Publication:1197697
DOI10.1016/0377-2217(92)90047-DzbMath0825.90458OpenAlexW2153234111MaRDI QIDQ1197697
Boaz Golany, Meir J. Rosenblatt
Publication date: 16 January 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(92)90047-d
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Quadratic programming (90C20) Production models (90B30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (4)
A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem ⋮ Network-based formulations of the quadratic assignment problem ⋮ An improved tabu search heuristic for solving facility layout design problems ⋮ Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
Cites Work
- Unnamed Item
- Quadratic assignment problems
- An algorithm for the quadratic assignment problem using Benders' decomposition
- The Quadratic Assignment Problem
- A Heuristic Procedure for the Layout of a Large Number of Facilities
- Techniques for Facilities Layout: Deciding which Pairs of Activities Should be Adjacent
- Assignment Problems and the Location of Economic Activities
- Multiple criteria approach to the facilities layout problem
- The Dynamics of Plant Layout
- A Cluster-Analytic Approach to Facility Layout
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
- DISCON: A New Method for the Layout Problem
- Numerical investigations on quadratic assignment problems
- An n‐step, 2‐variable search algorithm for the component placement problem
- Tree-search algorithms for quadratic assignment problems
- An integer programming approach to a class of combinatorial problems
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
This page was built for publication: A distance assignment approach to the facility layout problem