Lagrangian relaxation and enumeration for solving constrained shortest-path problems (Q3548726): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.20247 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4246153096 / rank | |||
Normal rank | |||
Revision as of 20:52, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lagrangian relaxation and enumeration for solving constrained shortest-path problems |
scientific article |
Statements
Lagrangian relaxation and enumeration for solving constrained shortest-path problems (English)
0 references
17 December 2008
0 references
near-shortest paths
0 references
label-setting algorithm
0 references
