Upgrading trees under diameter and budget constraints
From MaRDI portal
Publication:4797944
DOI10.1002/NET.10055zbMATH Open1035.90094OpenAlexW2117351196MaRDI QIDQ4797944FDOQ4797944
Authors: Victor Chepoi, Yann Vaxès, Hartmut Noltemeier
Publication date: 10 March 2003
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.10055
Recommendations
Programming involving graphs or networks (90C35) Trees (05C05) Discrete location and assignment (90B80)
Cites Work
Cited In (7)
- Optimizing budget allocation for center and median points
- Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks
- Lowering eccentricity of a tree by node upgrading
- Algorithms and Computation
- On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph
- Up- and downgrading the 1-center in a network
- Maintenance cost, toppling risk and size of trees in a self-thinning stand
This page was built for publication: Upgrading trees under diameter and budget constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4797944)