The Vertex Splitting Algorithm for facilities layout

DOI10.1080/002075497194615MaRDI QIDQ4245318zbMATH OpenOpenAlexFDO

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

Publication date 8 June 1999

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

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

Mathematics Subject Classification ID

Production models (90B30)

Recommendations

• A new approach to the block layout problem
• scientific article; zbMATH DE number 568799
• Efficient facility layout planning in a maximally planar graph model
• A New Graph-Theoretic Heuristic for Facility Layout

Cited in

(6)

• On finding a biconnected spanning planar subgraph with applications to the facilities layout problem
• A theory of L-shaped floor-plans
• A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem
• scientific article; zbMATH DE number 4008427 (Why is no real title available?)
• A new approach to the block layout problem
• Enumerating grid layouts of graphs

This page was built for publication: The Vertex Splitting Algorithm for facilities layout

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