The following pages link to Network upgrading problems (Q4861346):
Displaying 19 items.
- Optimizing budget allocation for center and median points (Q265070) (← links)
- Upgrading edge-disjoint paths in a ring (Q429680) (← links)
- Complexity of reducing the delay between two nodes by node-based and edge-based upgrading strategies (Q705041) (← links)
- Optimizing cost flows by edge cost and capacity upgrade (Q876725) (← links)
- Up- and downgrading the 1-center in a network (Q1026756) (← links)
- Approximation algorithms for certain network improvement problems (Q1282208) (← links)
- Minimizing broadcast costs under edge reductions in tree networks (Q1283789) (← links)
- Upgrading nodes in tree-shaped hub location (Q1628119) (← links)
- Lagrangian and branch-and-cut approaches for upgrading spanning tree problems (Q1652284) (← links)
- Upgrading min-max spanning tree problem under various cost functions (Q1680539) (← links)
- Improving spanning trees by upgrading nodes (Q1960523) (← links)
- On budget-constrained flow improvement. (Q2583570) (← links)
- Upgrading edges in the maximal covering location problem (Q2673553) (← links)
- Improving spanning trees by upgrading nodes (Q4571960) (← links)
- Upgrading arcs to minimize the maximum travel time in a network (Q5469125) (← links)
- Upgrading bottleneck constrained forests (Q5928872) (← links)
- Upgrading edges in the graphical TSP (Q6047867) (← links)
- The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation (Q6047913) (← links)
- On the complexity of the upgrading version of the maximal covering location problem (Q6541022) (← links)
