Combinatorial Benders Cuts for the Minimum Tollbooth Problem (Q3100444): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/opre.1090.0694 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1982862187 / rank | |||
Normal rank | |||
Latest revision as of 20:29, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combinatorial Benders Cuts for the Minimum Tollbooth Problem |
scientific article |
Statements
Combinatorial Benders Cuts for the Minimum Tollbooth Problem (English)
0 references
24 November 2011
0 references
congestion pricing
0 references
traffic equilibrium
0 references
Benders decomposition
0 references
branch and cut
0 references
mixed-integer program
0 references
