An adaptation of Eppstein's algorithm dealing with the k shortest – loopless and having at most p arcs – paths problem (Q3439461): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| 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.1016/j.endm.2006.06.056 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2014714999 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding the <i>K</i> Shortest Loopless Paths in a Network / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new implementation of Yen's ranking loopless paths algorithm / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:10, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An adaptation of Eppstein's algorithm dealing with the k shortest – loopless and having at most p arcs – paths problem |
scientific article |
Statements
An adaptation of Eppstein's algorithm dealing with the k shortest – loopless and having at most p arcs – paths problem (English)
0 references
29 May 2007
0 references
graph
0 references
constrained kSP
0 references
deviation algorithms
0 references
downstream logistics
0 references
