Pages that link to "Item:Q4962207"
From MaRDI portal
The following pages link to Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets (Q4962207):
Displaying 11 items.
- Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions (Q325382) (← links)
- Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
- Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty (Q723948) (← links)
- On the power of static assignment policies for robust facility location problems (Q2061885) (← links)
- A parameterized view to the robust recoverable base problem of matroids under structural uncertainty (Q2157911) (← links)
- LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization (Q2164699) (← links)
- Constrained submodular maximization via greedy local search (Q2294252) (← links)
- On the Optimality of Affine Policies for Budgeted Uncertainty Sets (Q5000650) (← links)
- A Polynomial-Time Approximation Scheme for Sequential Batch Testing of Series Systems (Q5080670) (← links)
- Running Errands in Time: Approximation Algorithms for Stochastic Orienteering (Q5245015) (← links)
- LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization (Q6589750) (← links)
