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 this page instead for the normal view: Efficient Algorithms for Solving the Shortest Covering Path Problem |
scientific article; zbMATH DE number 758412
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
