Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem

DOI10.1007/s10479-012-1221-3zbMath1303.90064MaRDI QIDQ490197

Yong-Cai Geng, Sumit K. Garg

Publication date: 22 January 2015

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-012-1221-3

zbMATH Keywords

transportation; branch and bound; discrete approximation; facility location-allocation

Mathematics Subject Classification ID

90C11: Mixed integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)

90B80: Discrete location and assignment