scientific article; zbMATH DE number 3950165
From MaRDI portal
Publication:3720256
Recommendations
Cited in
(15)- An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree
- Complexity results for the \(p\)-median problem with mutual communication
- The least element property of center location on tree networks with applications to distance and precedence constrained problems
- The hub location and routing problem
- L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem
- Planar multifacility location problems with tree structure and finite dominating sets
- scientific article; zbMATH DE number 3843458 (Why is no real title available?)
- Two classes of location problems on tree networks
- Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
- Technical Note—On the Complexity of Some Classes of Location Problems
- Balanced location on a graph
- Discrete convex functions on graphs and their algorithmic applications
- Parallel Complexity of Additive Location Problems
- Discrete convexity and polynomial solvability in minimum 0-extension problems
- Reviewing extensions and solution methods of the planar Weber single facility location problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3720256)