Enumerating \(K\) best paths in length order in DAGs (Q1926859): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2012.04.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1998132631 / rank | |||
Normal rank | |||
Revision as of 20:44, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Enumerating \(K\) best paths in length order in DAGs |
scientific article |
Statements
Enumerating \(K\) best paths in length order in DAGs (English)
0 references
29 December 2012
0 references
combinatorial optimization
0 references
shortest path algorithms
0 references
\(K\) best solutions
0 references
