The following pages link to On the minimax path in a network (Q3835758):
Displaying 10 items.
- Network reduction for the acyclic constrained shortest path problem (Q1206607) (← links)
- Strongly polynomial algorithms for finding minimax paths in networks and solution of cyclic games (Q1842405) (← links)
- Efficient algorithms for some path partitioning problems (Q1900138) (← links)
- Optimal paths in network games with \(p\) players (Q1962055) (← links)
- Minimum-link paths revisited (Q2450201) (← links)
- A constructive algorithm for max-min paths problems on energy networks (Q2518634) (← links)
- (Q3321860) (← links)
- Minimax trees, paths, and cut sets (Q3321863) (← links)
- Solving min-max shortest-path problems on a network (Q4018281) (← links)
- Global optimization: On pathlengths in min-max graphs (Q5928206) (← links)
