Pages that link to "Item:Q1014933"
From MaRDI portal
The following pages link to Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933):
Displaying 12 items.
- Minimizing recovery cost of network optimization problems (Q6179707) (← links)
- Robust capacitated Steiner trees and networks with uniform demands (Q6179720) (← links)
- On the complexity of robust multi-stage problems with discrete recourse (Q6180695) (← links)
- Randomized strategies for robust combinatorial optimization with approximate separation (Q6182680) (← links)
- Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty (Q6186579) (← links)
- Single machine adversarial bilevel scheduling problems (Q6554600) (← links)
- Graph coloring approaches for a production planning problem with makespan and setup penalties in a product-wheel context (Q6559404) (← links)
- Approximation guarantees for min-max-min robust optimization and \(k\)-adaptability under objective uncertainty (Q6561382) (← links)
- Benchmarking problems for robust discrete optimization (Q6568403) (← links)
- Efficient solutions to the \(m\)-machine robust flow shop under budgeted uncertainty (Q6588503) (← links)
- Robust optimization with scenarios using belief functions (Q6606644) (← links)
- Approximating the shortest path problem with scenarios (Q6652474) (← links)
