New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems (Q4653708)
From MaRDI portal
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
