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

DOI10.2307/3009473MaRDI QIDQ4173182zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(4)

• A tree search algorithm for the p-median problem
• Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
• A traffic-based model to the p-median problem in congested networks
• Solving capacitated clustering problems

This page was built for publication: A Branch and Bound Algorithm for the p-Median Transportation Problem

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