Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price (Q339594)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6651743
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price |
scientific article; zbMATH DE number 6651743 |
Statements
Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price (English)
0 references
11 November 2016
0 references
resource-constrained shortest-path problem
0 references
three-stage approach
0 references
re-optimization
0 references
fixed arcs
0 references
column generation
0 references
branch-and-price
0 references
0 references
0 references
0 references
0 references
0 references
0.8635159
0 references
0.8494622
0 references
0 references
0.8485869
0 references
0.8454959
0 references
0.8452956
0 references
0.8445949
0 references
