Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context (Q2371346)
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 5169661
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context |
scientific article; zbMATH DE number 5169661 |
Statements
Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context (English)
0 references
4 July 2007
0 references
discrete optimization
0 references
(T) integer programming
0 references
(T) graph theory
0 references
column-generation
0 references
resource-constrained shortest-path problem
0 references
multiple-resource
0 references
multiple-choice Knapsack problem
0 references
shortest-path problem with resource windows
0 references
0 references
0 references
0 references
0 references
0.9199038147926332
0 references
0.8572266697883606
0 references
0.784328818321228
0 references
0.7785601615905762
0 references
0.7698543071746826
0 references
