The following pages link to (Q3914777):
Displayed 14 items.
- A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem (Q337491) (← links)
- Dimensionality reduction in multiobjective shortest path search (Q342069) (← links)
- An algorithm for ranking paths that may contain cycles (Q759658) (← links)
- On a multicriteria shortest path problem (Q790051) (← links)
- On a special class of bicriterion path problems (Q793640) (← links)
- Optimal paths in bi-attribute networks with fractional cost functions (Q928022) (← links)
- On algorithms for the tricriteria shortest path problem with two bottleneck objective functions (Q976042) (← links)
- Finding non-dominated bicriteria shortest pairs of disjoint simple paths (Q1025230) (← links)
- The tricriterion shortest path problem with at least two bottleneck objective functions (Q1026760) (← links)
- An algorithm for ranking paths in acyclic networks (Q1050909) (← links)
- A biobjective Dijkstra algorithm (Q1728479) (← links)
- Shortest path problems with partial information: Models and algorithms for detecting dominance (Q1969885) (← links)
- On the bicriterion - minimal cost/minimal label - spanning tree problem (Q2655606) (← links)
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms (Q5308327) (← links)