Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context (Q2371346): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Knapsack / rank | |||
Normal rank | |||
Revision as of 13:22, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context |
scientific article |
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
