The accessibility arc upgrading problem
From MaRDI portal
Recommendations
- Upgrading arcs to minimize the maximum travel time in a network
- An efficient metaheuristic to improve accessibility by rural road network planning
- Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
- Upgrading Shortest Paths in Networks
- Upgrading edges in the maximal covering location problem
Cited in
(12)- Integrated optimal scheduling of repair crew and relief vehicle after disaster
- Improving post-disaster road network accessibility by strengthening links against failures
- Network repair crew scheduling for short-term disasters
- On the complexity and approximability of budget-constrained minimum cost flows
- Budget-constrained minimum cost flows
- An efficient metaheuristic to improve accessibility by rural road network planning
- Network repair crew scheduling and routing for emergency relief distribution problem
- The capacitated budgeted minimum cost flow problem with unit upgrading costs
- The p-median problem with upgrading of transportation costs and minimum travel time allocation
- Integrated optimal scheduling and routing of repair crew and relief vehicles after disaster: a novel hybrid solution approach
- On the complexity of the upgrading version of the maximal covering location problem
- Exploring the discrete and continuous edge improvement problems: models and algorithms
This page was built for publication: The accessibility arc upgrading problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2253452)
