Pages that link to "Item:Q337491"
From MaRDI portal
The following pages link to A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem (Q337491):
Displaying 12 items.
- Analysis of FPTASes for the multi-objective shortest path problem (Q1652052) (← links)
- Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach (Q1652278) (← links)
- A biobjective Dijkstra algorithm (Q1728479) (← links)
- Uncertain programming models for multi-objective shortest path problem with uncertain parameters (Q2153668) (← links)
- Facing robustness as a multi-objective problem: a bi-objective shortest path problem in smart regions (Q2224924) (← links)
- A discrete optimisation approach for target path planning whilst evading sensors (Q2669689) (← links)
- Simple and efficient bi-objective search algorithms via fast dominance checks (Q2680770) (← links)
- An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem (Q5084630) (← links)
- Ant Lion Optimized Lexicographic Model for Shortest Path Identification (Q5877217) (← links)
- Eco-routing problem for the delivery of perishable products (Q6109571) (← links)
- Uncertain multi-objective multi-route shortest path problem by robust enhanced non-dominated sorting genetic algorithms: application to emergency medical services (Q6593200) (← links)
- Enhanced non-dominated sorting genetic algorithms for uncertain multi-objective shortest path problem: application to fire prevention services (Q6664543) (← links)
