Pages that link to "Item:Q924631"
From MaRDI portal
The following pages link to Complexity of the min-max (regret) versions of min cut problems (Q924631):
Displaying 10 items.
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem (Q319447) (← links)
- Combinatorial optimization problems with uncertain costs and the OWA criterion (Q482291) (← links)
- Exact and heuristic algorithms for the interval data robust assignment problem (Q632649) (← links)
- Complexity of the min-max and min-max regret assignment problems (Q813974) (← links)
- Using the WOWA operator in robust discrete optimization problems (Q895514) (← links)
- A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization (Q2197476) (← links)
- Combinatorial two-stage minmax regret problems under interval uncertainty (Q2241200) (← links)
- Complexity of minimizing the total flow time with interval data and minmax regret criterion (Q2433804) (← links)
- On complexity of the translational-cut algorithm for convex minimax problems (Q5925720) (← links)
- Robust Algorithms for TSP and Steiner Tree (Q6075747) (← links)
