New dynamic programming algorithms for the resource constrained elementary shortest path problem (Q3507646): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1543377438 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An optimization algorithm for a penalized knapsack problem / rank | |||
Normal rank | |||
Latest revision as of 11:25, 28 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New dynamic programming algorithms for the resource constrained elementary shortest path problem |
scientific article |
Statements
New dynamic programming algorithms for the resource constrained elementary shortest path problem (English)
0 references
20 June 2008
0 references
shortest path
0 references
vehicle-routing
0 references
column generation
0 references
dynamic-programming
0 references
branch-and-bound
0 references
