Lagrangian relaxation and enumeration for solving constrained shortest-path problems (Q3548726): Difference between revisions
From MaRDI portal
Latest revision as of 21:59, 28 June 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
0 references
0 references