An Algorithm for Solving Capacitated Multicommodity p-median Transportation Problems

DOI10.1057/JORS.1993.51zbMATH Open0771.90069OpenAlexW2002423250MaRDI QIDQ5287230FDOQ5287230

Authors: Buyang Cao, Götz Uebe 

Publication date: 16 August 1993

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

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

Recommendations

• Two exact algorithms for the capacitated \(p\)-median problem
• A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points
• A branch‐and‐price algorithm for the capacitated p‐median problem
• An efficient heuristic algorithm for the capacitated \(p\)-median problem
• A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements

zbMATH Keywords

Lagrangean relaxationcapacitated multicommodity \(p\)-median transporationheurisic branch-and-bound algorithm

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cited In (4)

• Title not available (Why is that?)
• The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation
• The capacitated \(p\)-hub median problem with integral constraints: an application to a Chinese air cargo network
• Transshipment of containers at a container terminal: An overview

This page was built for publication: An Algorithm for Solving Capacitated Multicommodity p-median Transportation Problems

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