An algorithm for the resource constrained shortest path problem (Q3827808): Difference between revisions
From MaRDI portal
Removed claims |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: John E. Beasley / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Nicos Christofides / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230190402 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2130679277 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3048571 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding the <i>K</i> Shortest Loopless Paths in a Network / rank | |||
Normal rank | |||
Latest revision as of 14:31, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for the resource constrained shortest path problem |
scientific article |
Statements
An algorithm for the resource constrained shortest path problem (English)
0 references
1989
0 references
shortest path
0 references
tree search
0 references
lower bound
0 references
Lagrangean relaxation
0 references
Computational results
0 references
