The accessibility arc upgrading problem
From MaRDI portal
Publication:2253452
DOI10.1016/J.EJOR.2012.09.005zbMATH Open1292.90071OpenAlexW2035946568MaRDI QIDQ2253452FDOQ2253452
Authors: Pablo A. Maya Duque, Sofie Coene, P. Goos, K. Sörensen, Frits C. R. Spieksma 
Publication date: 27 July 2014
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/10067/968950151162165141
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 (11)
- An efficient metaheuristic to improve accessibility by rural road network planning
- Network repair crew scheduling for short-term disasters
- The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation
- Budget-constrained minimum cost flows
- Improving post-disaster road network accessibility by strengthening links against failures
- Integrated optimal scheduling of repair crew and relief vehicle after disaster
- On the complexity and approximability of budget-constrained minimum cost flows
- Network repair crew scheduling and routing for emergency relief distribution problem
- Integrated optimal scheduling and routing of repair crew and relief vehicles after disaster: a novel hybrid solution approach
- The capacitated budgeted minimum cost flow problem with unit upgrading costs
- On the complexity of the upgrading version of the maximal covering location problem
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)
