On the unboundedness of facility layout problems
From MaRDI portal
Publication:604804
DOI10.1007/s00186-010-0317-2zbMath1200.49017OpenAlexW2059609414MaRDI QIDQ604804
Publication date: 12 November 2010
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-010-0317-2
Related Items (2)
Effects of scatter plot initial solutions on regular grid facility layout algorithms in typical production models ⋮ The impact of client choice on preventive healthcare facility network design
Cites Work
- Unnamed Item
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- Solving circle packing problems by global optimization: numerical results and industrial applications
- An attractor-repeller approach to floorplanning
- Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
- A New Mathematical-Programming Framework for Facility-Layout Design
- A Heuristic Procedure for the Layout of a Large Number of Facilities
- Assignment Problems and the Location of Economic Activities
- The Weber Problem On The Plane With Some Negative Weights
- DISCON: A New Method for the Layout Problem
- Some remarks on scatter plots generation procedures for facility layout
- A spring-embedding approach for the facility layout problem
This page was built for publication: On the unboundedness of facility layout problems
