Pages that link to "Item:Q976089"
From MaRDI portal
The following pages link to On the approximability of minmax (regret) network optimization problems (Q976089):
Displaying 15 items.
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320) (← links)
- Combinatorial optimization problems with uncertain costs and the OWA criterion (Q482291) (← links)
- On the approximability of robust spanning tree problems (Q620950) (← links)
- Minmax regret location--allocation problem on a network under uncertainty (Q864020) (← links)
- Using the WOWA operator in robust discrete optimization problems (Q895514) (← links)
- An \(O(mn)\) algorithm for the 1-maximin problem on a network (Q1304521) (← links)
- Approximability of the robust representatives selection problem (Q1785311) (← links)
- Min-max and min-max (relative) regret approaches to representatives selection problem (Q1936659) (← links)
- Socially fair network design via iterative rounding (Q2084030) (← links)
- Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty (Q2125227) (← links)
- A randomized algorithm for the min-Max selecting items problem with uncertain weights (Q2267304) (← links)
- Robust Discrete Optimization Problems with the WOWA Criterion (Q2806941) (← links)
- Recoverable robust shortest path problems (Q2892155) (← links)
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows (Q2962560) (← links)
- Approximating the shortest path problem with scenarios (Q6652474) (← links)
