Complexity and Approximation of the Continuous Network Design Problem (Q2969620)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6696507
| 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 6696507 |
Statements
22 March 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 algorithm
0 references
0 references
0.94225955
0 references
0.94225955
0 references
0.93424535
0 references
0.93245685
0 references
0.93245685
0 references
0.92728686
0 references
0.92364323
0 references
