Network upgrading problems
From MaRDI portal
DOI10.1002/NET.3230260105zbMATH Open0840.90067OpenAlexW2149161872MaRDI QIDQ4861346FDOQ4861346
Authors: Doowon Paik, Sartaj Sahni 
Publication date: 16 January 1996
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230260105
Recommendations
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18)
Cites Work
Cited In (19)
- Optimizing budget allocation for center and median points
- Upgrading arcs to minimize the maximum travel time in a network
- To improve the communication delay by upgrading nodes in a continuous version
- Complexity of reducing the delay between two nodes by node-based and edge-based upgrading strategies
- The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation
- Upgrading bottleneck constrained forests
- Upgrading edge-disjoint paths in a ring
- Upgrading nodes in tree-shaped hub location
- Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
- Minimizing broadcast costs under edge reductions in tree networks
- Optimizing cost flows by edge cost and capacity upgrade
- Upgrading edges in the maximal covering location problem
- Upgrading edges in the graphical TSP
- Improving spanning trees by upgrading nodes
- Improving spanning trees by upgrading nodes
- Upgrading min-max spanning tree problem under various cost functions
- Up- and downgrading the 1-center in a network
- On budget-constrained flow improvement.
- On the complexity of the upgrading version of the maximal covering location problem
This page was built for publication: Network upgrading problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4861346)
