Pages that link to "Item:Q4012771"
From MaRDI portal
The following pages link to A New Graph-Theoretic Heuristic for Facility Layout (Q4012771):
Displaying 16 items.
- A connectivity graph generation approach for Manhattan path calculation in detailed facility layout (Q274980) (← links)
- The facility layout problem (Q1088577) (← links)
- On finding a biconnected spanning planar subgraph with applications to the facilities layout problem (Q1278276) (← links)
- Comment on ``The facility layout problem'' (Q1333526) (← links)
- Location and layout planning. A survey (Q1372765) (← links)
- Two new heuristic algorithms for the maximal planar layout problem (Q1374393) (← links)
- FACOPT: A user friendly FACility layout OPTimization system. (Q1422356) (← links)
- Facilities layout generalized model solved by n-boundary shortest path heuristics (Q1820668) (← links)
- Maximum planar subgraphs and nice embeddings: Practical layout tools (Q1920420) (← links)
- A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem (Q2489303) (← links)
- A genetic algorithm and queuing theory based methodology for facilities layout problem (Q3055282) (← links)
- Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics (Q3693214) (← links)
- Machine layout problem in modern manufacturing facilities (Q4394376) (← links)
- Linear programming based meta-heuristics for the weighted maximal planar graph (Q4656733) (← links)
- Enumerating Grid Layouts of Graphs (Q5119387) (← links)
- Local Search Algorithms for the Maximal Planar Layout Problem (Q5689972) (← links)