Hard cases of the multifacility location problem

DOI10.1016/J.DAM.2003.05.005MaRDI QIDQ1887076zbMATH OpenOpenAlexFDO

Authors Alexander V. Karzanov

Publication date 23 November 2004

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2003.05.005

zbMATH Keywords

Location problemMetric extensionModulargraphMultiterminal (multiway) cut

Mathematics Subject Classification ID

Distance in graphs (05C12) Discrete location and assignment (90B80) Combinatorial optimization (90C27)

Recommendations

• One more well-solved case of the multifacility location problem
• A characterization of minimizable metrics in the multifacility location problem
• A multifacility location problem on median spaces
• The Complexity of Multiterminal Cuts
• On the Complexity of Some Common Geometric Location Problems

Cites work

• A characterization of minimizable metrics in the multifacility location problem
• A multifacility location problem on median spaces
• Minimum 0-extensions of graph metrics
• Minimum \((2,r)\)-metrics and integer multiflows
• Networks with Condorcet solutions
• One more well-solved case of the multifacility location problem
• State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
• The Complexity of Multiterminal Cuts

Cited in

(6)

• A characterization of minimizable metrics in the multifacility location problem
• Minimum 0-extension problems on directed metrics
• One more well-solved case of the multifacility location problem
• Acceleration of the HAP approach for the multifacility location problem
• scientific article; zbMATH DE number 7559417 (Why is no real title available?)
• Discrete convexity and polynomial solvability in minimum 0-extension problems

This page was built for publication: Hard cases of the multifacility location problem

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