A branch and bound algorithm for locating input and output points of departments on the block layout

DOI10.1057/palgrave.jors.2600720zbMath1054.90589OpenAlexW1990279009MaRDI QIDQ3157355

Yeong-Dae Kim, Jae-Gon Kim

Publication date: 13 January 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600720

zbMATH Keywords

branch and bound algorithmfacility layoutinput and output points

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Continuous location (90B85)

Related Items (4)

Optimal facility layout and material handling network design ⋮ A three-phase heuristic algorithm for fixed-charge capacitated material flow network design with input/output points location ⋮ A convex optimisation framework for the unequal-areas facility layout problem ⋮ Integrated slicing tree approach for solving the facility layout problem with input and output locations based on contour distance

This page was built for publication: A branch and bound algorithm for locating input and output points of departments on the block layout