Pages that link to "Item:Q2865872"
From MaRDI portal
The following pages link to Variants of shortest path problems (Q2865872):
Displaying 11 items.
- On the generality of the greedy algorithm for solving matroid base problems (Q496445) (← links)
- Robust balanced optimization (Q668952) (← links)
- A class of exponential neighbourhoods for the quadratic travelling salesman problem (Q782742) (← links)
- The \(k\)-centrum shortest path problem (Q997931) (← links)
- Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions (Q1622795) (← links)
- Shortest paths with shortest detours. A biobjective routing problem (Q1673931) (← links)
- Shortest path with acceleration constraints: complexity and approximation algorithms (Q2082550) (← links)
- A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks (Q2664012) (← links)
- Balanced Optimization with Vector Costs (Q2971159) (← links)
- An algebraic framework for multi-objective and robust variants of path problems (Q3297414) (← links)
- A branch-and-cut algorithm for the balanced traveling salesman problem (Q6123381) (← links)
