The following pages link to Solving 0-1 Minimax Problems (Q3754438):
Displaying 4 items.
- Generalized multiple objective bottleneck problems (Q453049) (← links)
- Finding approximate solutions to minimax problems (Q1569265) (← links)
- An efficient heuristic algorithm for the bottleneck traveling salesman problem (Q2269075) (← links)
- Remarks on 0-1 Optimization Problems with Superincreasing and Superdecreasing Objective Functions (Q3557805) (← links)