Complexity and approximation of the continuous network design problem

DOI10.1137/15M1016461MaRDI QIDQ5348461zbMATHOpenAlexFDO

Authors 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

zbMATH Keywords

computational complexityapproximation algorithmsbilevel optimizationnetwork designwardrop equilibriumoptimization under equilibrium constraints

Mathematics Subject Classification ID

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)

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

Cites work

• An efficient dual approach to the urban road network design problem
• An overview of bilevel optimization
• Avoiding the Braess paradox in non-cooperative networks
• Complexity and Approximation of the Continuous Network Design Problem
• Efficient implementation of heuristics for the continuous network design problem
• Geometric algorithms and combinatorial optimization.
• How bad is selfish routing?
• Inefficiency of Nash Equilibria
• Mathematical Programs with Equilibrium Constraints
• Network Improvement for Equilibrium Routing
• Network design problem with congestion effects: A case of bilevel programming
• Network flows. Theory, algorithms, and applications.
• On the severity of Braess's paradox: designing networks for selfish users is hard
• Selfish Routing in Capacitated Networks
• Stronger bounds on Braess's paradox and the maximum latency of selfish routing
• The price of anarchy is independent of the network topology
• Über ein Paradoxon aus der Verkehrsplanung

Cited in

(8)

• Complexity and Approximation of the Continuous Network Design Problem
• The non-approximability of bicriteria network design problems
• A tri-level optimization model for a private road competition problem with traffic equilibrium constraints
• A DC programming approach to the continuous equilibrium network design problem
• A survey on mixed-integer programming techniques in bilevel optimization
• A Unified Framework for Pricing in Nonconvex Resource Allocation Games
• 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)