A Branch and Bound Algorithm for the p-Median Transportation Problem

DOI10.2307/3009473zbMath0391.90057OpenAlexW4248212530MaRDI QIDQ4173182

Alan W. Neebe

Publication date: 1978

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

Full work available at URL: https://doi.org/10.2307/3009473

zbMATH Keywords

Branch and Bound AlgorithmLagrangian RelaxationP-Median Transportation Problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06)

Related Items

A tree search algorithm for the p-median problem, Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem, Solving capacitated clustering problems