Pages that link to "Item:Q3354559"
From MaRDI portal
The following pages link to Two graph-theoretic procedures for an improved solution to the facilities layout problem (Q3354559):
Displayed 6 items.
- Two new heuristic algorithms for the maximal planar layout problem (Q1374393) (← links)
- A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem (Q2489303) (← links)
- TESSA—A new greedy heuristic for facilities layout planning (Q4024623) (← links)
- On the worst case performance of TESSA (Q4230283) (← links)
- A reply to ‘A note on “On TESSA”’ (Q4394194) (← links)
- A note on 'Maximally weighted graph theoretic facilities design planning' (Q4674441) (← links)