Pages that link to "Item:Q3693214"

The following pages link to Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics (Q3693214):

Displayed 17 items.

• Efficient models for the facility layout problem (Q803026) ‎ (← links)
• Analysis of heuristics for finding a maximum weight planar subgraph (Q1062924) ‎ (← links)
• The facility layout problem (Q1088577) ‎ (← links)
• An algorithm for quadratic assignment problems (Q1130047) ‎ (← links)
• Integrating facility layout with process selection and capacity planning (Q1197685) ‎ (← links)
• An interactive layout heuristic based on hexagonal adjacency graphs (Q1205707) ‎ (← links)
• Location and layout planning. A survey (Q1372765) ‎ (← links)
• Two new heuristic algorithms for the maximal planar layout problem (Q1374393) ‎ (← links)
• A heuristic procedure for the single-row facility layout problem (Q1390259) ‎ (← links)
• Facilities layout generalized model solved by n-boundary shortest path heuristics (Q1820668) ‎ (← links)
• A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem (Q2489303) ‎ (← links)
• A continuous approach to considering uncertainty in facility design (Q2581616) ‎ (← links)
• Two graph-theoretic procedures for an improved solution to the facilities layout problem (Q3354559) ‎ (← links)
• Maximum weight matching and genetic algorithm for fixed-shape facility layout problem (Q3605401) ‎ (← links)
• TESSA—A new greedy heuristic for facilities layout planning (Q4024623) ‎ (← links)
• Facilities layout design optimization with single loop material flow path configuration (Q4398901) ‎ (← links)
• Branch-and-bound techniques for the maximum planar subgraph problem^∗ (Q4844576) ‎ (← links)