Pages that link to "Item:Q810382"
From MaRDI portal
The following pages link to A parametric approach to solving bicriterion shortest path problems (Q810382):
Displaying 29 items.
- A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem (Q337491) (← links)
- A comparison of heuristic best-first algorithms for bicriterion shortest path problems (Q439323) (← links)
- Solving multi-objective traffic assignment (Q490239) (← links)
- Routing with nonlinear multiattribute cost functions (Q686201) (← links)
- A preference-based approach to spanning trees and shortest paths problems (Q704097) (← links)
- Optimal paths in bi-attribute networks with fractional cost functions (Q928022) (← links)
- Extended dominance and a stochastic shortest path problem (Q954058) (← links)
- A comparison of solution strategies for biobjective shortest path problems (Q958463) (← links)
- On algorithms for the tricriteria shortest path problem with two bottleneck objective functions (Q976042) (← links)
- The \(k\)-centrum shortest path problem (Q997931) (← links)
- On the sum-max bicriterion path problem. (Q1406718) (← links)
- The interactive analysis of the multicriteria shortest path problem by the reference point method. (Q1406958) (← links)
- Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network (Q1630202) (← links)
- Analysis of FPTASes for the multi-objective shortest path problem (Q1652052) (← links)
- A biobjective Dijkstra algorithm (Q1728479) (← links)
- Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem (Q1776955) (← links)
- Multiobjective routing problems (Q1919112) (← links)
- A label correcting approach for solving bicriterion shortest-path problems (Q1977617) (← links)
- A relation of dominance for the bicriterion bus routing problem (Q2012147) (← links)
- Multiobjective transportation network design and routing problems: Taxonomy and annotation (Q2368289) (← links)
- On the cardinality of the Pareto set in bicriteria shortest path problems (Q2379876) (← links)
- Multicriteria adaptive paths in stochastic, time-varying networks (Q2491770) (← links)
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices (Q2572862) (← links)
- Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem (Q2581622) (← links)
- Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points (Q2664305) (← links)
- Multicriteria path and tree problems: discussion on exact algorithms and applications (Q4918252) (← links)
- An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem (Q5084630) (← links)
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms (Q5308327) (← links)
- The Steiner bi-objective shortest path problem (Q6114902) (← links)
