Complexity and approximation of the continuous network design problem (Q5348461)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity and approximation of the continuous network design problem |
scientific article; zbMATH DE number 6760751
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and approximation of the continuous network design problem |
scientific article; zbMATH DE number 6760751 |
Statements
Complexity and Approximation of the Continuous Network Design Problem (English)
0 references
16 August 2017
0 references
bilevel optimization
0 references
optimization under equilibrium constraints
0 references
network design
0 references
wardrop equilibrium
0 references
computational complexity
0 references
approximation algorithms
0 references
0.9910982847213744
0 references
0.765630304813385
0 references
0.7642035484313965
0 references
0.7628064155578613
0 references
0.7547323703765869
0 references
