Efficient Algorithms for Solving the Shortest Covering Path Problem (Q4834229)
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 758412
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient Algorithms for Solving the Shortest Covering Path Problem |
scientific article; zbMATH DE number 758412 |
Statements
Efficient Algorithms for Solving the Shortest Covering Path Problem (English)
0 references
28 May 1995
0 references
shortest covering path problem
0 references
least cost path
0 references
pre-specified starting node
0 references
pre-specified terminus node
0 references
heuristic
0 references
Lagrangian relaxation
0 references
branch-and-bound
0 references
0 references
0.9211902
0 references
0.9127236
0 references
0.89983034
0 references
0.8980017
0 references
0.89308643
0 references
0.89280444
0 references
0.8916532
0 references
