New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems (Q4653708): 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.1080/00207160412331296715 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2160056724 / rank | |||
Normal rank | |||
Revision as of 00:20, 20 March 2024
scientific article; zbMATH DE number 2141544
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems |
scientific article; zbMATH DE number 2141544 |
Statements
New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems (English)
0 references
7 March 2005
0 references
Networks, Multiple objectives, Pareto minimum paths, \(k\)-Shortest paths
0 references
