Network design problem with congestion effects: A case of bilevel programming (Q3741367)
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 3976733
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Network design problem with congestion effects: A case of bilevel programming |
scientific article; zbMATH DE number 3976733 |
Statements
Network design problem with congestion effects: A case of bilevel programming (English)
0 references
1986
0 references
Stackelberg games
0 references
decomposition
0 references
minimum cost design
0 references
transportation network
0 references
user optimal routing
0 references
bi-level programming
0 references
flow optimization
0 references
capacity optimization
0 references
worst-case bound
0 references
heuristic
0 references
0 references
0 references
0.7874010801315308
0 references
0.7839186787605286
0 references
0.7784297466278076
0 references
0.7777905464172363
0 references
