A distance assignment approach to the facility layout problem
From MaRDI portal
Publication:1197697
Cites work
- scientific article; zbMATH DE number 3523317 (Why is no real title available?)
- A Cluster-Analytic Approach to Facility Layout
- A Heuristic Procedure for the Layout of a Large Number of Facilities
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- An n‐step, 2‐variable search algorithm for the component placement problem
- An algorithm for the quadratic assignment problem using Benders' decomposition
- An integer programming approach to a class of combinatorial problems
- Assignment Problems and the Location of Economic Activities
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
- DISCON: A New Method for the Layout Problem
- Multiple criteria approach to the facilities layout problem
- Numerical investigations on quadratic assignment problems
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
- Quadratic assignment problems
- Techniques for Facilities Layout: Deciding which Pairs of Activities Should be Adjacent
- The Dynamics of Plant Layout
- The quadratic assignment problem
- Tree-search algorithms for quadratic assignment problems
Cited in
(4)- Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
- 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
This page was built for publication: A distance assignment approach to the facility layout problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1197697)