Efficient Algorithms for Solving the Shortest Covering Path Problem (Q4834229): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/trsc.28.4.317 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/trsc.28.4.317 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2128634324 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/TRSC.28.4.317 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 16:16, 30 December 2024
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
