Nodal aggregation of resource constraints in a shortest path problem (Q2490165)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Nodal aggregation of resource constraints in a shortest path problem |
scientific article; zbMATH DE number 5021254
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nodal aggregation of resource constraints in a shortest path problem |
scientific article; zbMATH DE number 5021254 |
Statements
Nodal aggregation of resource constraints in a shortest path problem (English)
0 references
28 April 2006
0 references
Shortest path
0 references
Dynamic programming
0 references
Resource constraints
0 references
Resource aggregation
0 references
Lagrangian relaxation
0 references
Surrogate relaxation
0 references
Column generation
0 references
0 references
0 references
0 references
0 references
0.89436686
0 references
0.89090234
0 references
0.88018596
0 references
0.8739791
0 references
0.8701388
0 references
0.8683735
0 references
