The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem (Q296774)
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 with (k, 2)-loop elimination and its application to the capacitated arc-routing problem |
scientific article; zbMATH DE number 6597511
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem |
scientific article; zbMATH DE number 6597511 |
Statements
The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem (English)
0 references
23 June 2016
0 references
constrained shortest paths
0 references
cycle elimination
0 references
capacitated arc-routing problem
0 references
0 references
0 references
0 references
0 references
0.8340277075767517
0 references
0.8339778184890747
0 references
0.823034942150116
0 references
0.8165381550788879
0 references
0.803202211856842
0 references
