Complexity and Approximation of the Continuous Network Design Problem

DOI10.4230/LIPIcs.APPROX-RANDOM.2014.226zbMath1360.90047arXiv1307.4258MaRDI QIDQ2969620

Martin Gairing, Max Klimm, Tobias Harks

Publication date: 22 March 2017

Full work available at URL: https://arxiv.org/abs/1307.4258

zbMATH Keywords

computational complexityapproximation algorithmnetwork designbilevel optimizationwardrop equilibriumoptimization under equilibrium constraints

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (1)

Complexity and Approximation of the Continuous Network Design Problem

This page was built for publication: Complexity and Approximation of the Continuous Network Design Problem