The following pages link to Minmax combinatorial optimization (Q1130081):
Displaying 10 items.
- The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis (Q336878) (← links)
- Min-max-min robust combinatorial optimization (Q526823) (← links)
- Computational approaches to a combinatorial optimization problem arising from text classification (Q868131) (← links)
- Min-max optimization of several classical discrete optimization problems (Q1265052) (← links)
- On combined minmax-minsum optimization (Q1333027) (← links)
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems (Q1762141) (← links)
- Solving combinatorial problems with combined min-max-min-sum objective and applications (Q1824562) (← links)
- (Q3330973) (← links)
- Heuristic scheduling of parallel machines with sequence-dependent set-up times (Q4443334) (← links)
- Generalized Bottleneck Problems<sup>∗</sup> (Q4859828) (← links)