Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound (Q2770085): 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.46.2.247 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2123550810 / rank | |||
Normal rank | |||
Latest revision as of 19:02, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound |
scientific article |
Statements
Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound (English)
0 references
7 February 2002
0 references
computational tests
0 references
network design
0 references
multicommodity minimal cost network flow
0 references
linear mixed-integer programming
0 references
transportation networks
0 references
Lagrangean heuristic
0 references
