Best location of service centers in a treelike network under budget constraints
DOI10.1016/0012-365X(90)90361-KzbMATH Open0718.90053OpenAlexW2075371755MaRDI QIDQ2639769FDOQ2639769
Authors: James A. M. McHugh, Yehoshua Perl 
Publication date: 1990
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(90)90361-k
Recommendations
Programming involving graphs or networks (90C35) Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- A linear algorithm for the domination number of a tree
- Efficient Algorithm for the Partitioning of Trees
- On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
- Optimum domination in weighted trees
- Title not available (Why is that?)
- Efficient Optimization of Monotonic Functions on Trees
- Circuit partitioning with size and connection constraints
Cited In (7)
- Optimal M/G/1 server location on a tree network with continuous link demands
- Dynamic location problems with radial structure of the components of the connecting graph
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Controlling and optimizing the transport (search) efficiency with local information on a class of scale-free trees
This page was built for publication: Best location of service centers in a treelike network under budget constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2639769)
