Complexity and approximation of the continuous network design problem
DOI10.1137/15M1016461zbMATH Open1376.90068OpenAlexW3021232757MaRDI QIDQ5348461FDOQ5348461
Martin Gairing, Tobias Harks, Max Klimm
Publication date: 16 August 2017
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/15m1016461
Recommendations
- Complexity and Approximation of the Continuous Network Design Problem
- A DC programming approach to the continuous equilibrium network design problem
- A globally convergent algorithm for transportation continuous network design problem
- Network Improvement for Equilibrium Routing
- Approximation and Online Algorithms
computational complexityapproximation algorithmsbilevel optimizationnetwork designwardrop equilibriumoptimization under equilibrium constraints
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Title not available (Why is that?)
- Selfish Routing in Capacitated Networks
- The price of anarchy is independent of the network topology
- An overview of bilevel optimization
- On the severity of Braess's paradox: designing networks for selfish users is hard
- How bad is selfish routing?
- Über ein Paradoxon aus der Verkehrsplanung
- Geometric algorithms and combinatorial optimization.
- Network design problem with congestion effects: A case of bilevel programming
- Efficient implementation of heuristics for the continuous network design problem
- Mathematical Programs with Equilibrium Constraints
- Inefficiency of Nash Equilibria
- Avoiding the Braess paradox in non-cooperative networks
- An efficient dual approach to the urban road network design problem
- Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing
- Network Improvement for Equilibrium Routing
- Complexity and Approximation of the Continuous Network Design Problem
Cited In (7)
- A tri-level optimization model for a private road competition problem with traffic equilibrium constraints
- A Unified Framework for Pricing in Nonconvex Resource Allocation Games
- The non-approximability of bicriteria network design problems
- Complexity and Approximation of the Continuous Network Design Problem
- A survey on mixed-integer programming techniques in bilevel optimization
- The Continuous-Time Service Network Design Problem
- Stackelberg pricing games with congestion effects
This page was built for publication: Complexity and approximation of the continuous network design problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5348461)
