One more well-solved case of the multifacility location problem

DOI10.1016/J.DISOPT.2004.04.001MaRDI QIDQ2386213zbMATH OpenOpenAlexFDO

Authors Alexander V. Karzanov

Publication date 22 August 2005

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2004.04.001

zbMATH Keywords

Multiterminal cutLocation problemMetric extensionModular graphRetraction of graphs

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Distance in graphs (05C12) Discrete location and assignment (90B80)

Recommendations

• Hard cases of the multifacility location problem
• Solving Structured Multifacility Location Problems Efficiently
• Solving the multiple competitive facilities location problem
• An Efficient Algorithm for Solving the Rectilinear Multifacility Location Problem
• Multifacility location problems on a sphere
• An extended multifacility minimax location problem revisited
• The Euclidean Multifacility Location Problem
• Multi-level facility location problems
• On the exact solution of a facility layout problem
• A multifacility location problem on median spaces

Cites work

• A characterization of minimizable metrics in the multifacility location problem
• A combinatorial algorithm for the minimum \((2,r)\)-metric problem and some generalizations
• A multifacility location problem on median spaces
• Absolute retracts of bipartite graphs
• Combinatorial theory.
• Hard cases of the multifacility location problem
• Median graphs and Helly hypergraphs
• Minimum 0-extensions of graph metrics
• Minimum \((2,r)\)-metrics and integer multiflows
• Networks with Condorcet solutions
• State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
• The Complexity of Multiterminal Cuts

Cited in

(9)

• Discrete convexity and polynomial solvability in minimum 0-extension problems
• scientific article; zbMATH DE number 7559417 (Why is no real title available?)
• Discrete convex functions on graphs and their algorithmic applications
• Hard cases of the multifacility location problem
• Minimum 0-extension problems on directed metrics
• Metric packing for \(K_ 3 + K_ 3\)
• Weakly Modular Graphs and Nonpositive Curvature
• A characterization of minimizable metrics in the multifacility location problem
• Generalized minimum 0-extension problem and discrete convexity

This page was built for publication: One more well-solved case of the multifacility location problem

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