A comparison of heuristic best-first algorithms for bicriterion shortest path problems (Q439323): 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.2011.08.030 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2001308858 / rank | |||
Normal rank | |||
Revision as of 20:42, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A comparison of heuristic best-first algorithms for bicriterion shortest path problems |
scientific article |
Statements
A comparison of heuristic best-first algorithms for bicriterion shortest path problems (English)
0 references
16 August 2012
0 references
search theory
0 references
combinatorial optimization
0 references
multiobjective shortest path problem
0 references
best-first search
0 references
heuristic search
0 references
artificial intelligence
0 references
