The shortest-path problem with resource constraints and \(k\)-cycle elimination for \(k\geq 3\) (Q2892297)
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: The shortest-path problem with resource constraints and k-cycle elimination for k 3 |
scientific article; zbMATH DE number 6047414
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The shortest-path problem with resource constraints and \(k\)-cycle elimination for \(k\geq 3\) |
scientific article; zbMATH DE number 6047414 |
Statements
18 June 2012
0 references
shortest paths
0 references
cycle elimination
0 references
column generation
0 references
vehicle routing
0 references
The shortest-path problem with resource constraints and \(k\)-cycle elimination for \(k\geq 3\) (English)
0 references
0.9876545667648317
0 references
0.877010703086853
0 references
0.863714337348938
0 references
0.8340277075767517
0 references
