On the worst case performance of TESSA

DOI10.1080/00207549608905068MaRDI QIDQ4230283zbMATH OpenOpenAlexFDO

Authors K. H. Watson, J. W. Giffin

Publication date 1 March 1999

Published in International Journal of Production Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207549608905068

zbMATH Keywords

facility layout heuristicTESSAworst case performance

Mathematics Subject Classification ID

Production models (90B30) Programming involving graphs or networks (90C35)

Recommendations

• On the performance characteristics of a TASI system
• Beyond the Worst-Case Analysis of Algorithms
• STACS 2004
• Exact Worst Case TCAM Rule Expansion
• On the worst-case inefficiency of CGKA
• On the performance of Turing's formula: a simulation study
• On worst case design strategies
• A theoretical framework for the TTA algorithm
• Worst-case comparison of valid inequalities for the TSP

Cites work

• Construction properties of combinatorial deltahedra
• Discussion A note on ‘On TESSA’
• TESSA—A new greedy heuristic for facilities layout planning
• Two graph-theoretic procedures for an improved solution to the facilities layout problem

Cited in

(1)

• Exact Worst Case TCAM Rule Expansion

This page was built for publication: On the worst case performance of TESSA

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4230283)