The Multimedian Location Problem on a Network Exploiting Block Structure

DOI10.1287/TRSC.28.2.116MaRDI QIDQ4302928zbMATH OpenOpenAlexFDO

Authors

Publication date 27 September 1995

Published in Transportation Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/trsc.28.2.116

zbMATH Keywords

blocking graphbranch-and-boundconnected networkmultimedian problempolynomial time

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Programming involving graphs or networks (90C35)

Recommendations

• An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree
• An improved lower bound for the multimedian location problem
• A multifacility location problem on median spaces
• Solving nonlinear multiple-facility network location problems

Cited in

(7)

• 'Multidimensional' extensions and a nested dual approach for the m-median problem
• An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree
• Locating a facility on a network with multiple median-type objectives
• A multifacility location problem on median spaces
• Block-vertex duality and the one-median problem
• Solving nonlinear multiple-facility network location problems
• A distribution map for the one-median location problem on a network

This page was built for publication: The Multimedian Location Problem on a Network Exploiting Block Structure

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