Pages that link to "Item:Q2050273"
From MaRDI portal
The following pages link to Solving robust two-stage combinatorial optimization problems under convex uncertainty (Q2050273):
Displaying 17 items.
- The robust set covering problem with interval data (Q367647) (← links)
- On 2-stage robust LP with RHS uncertainty: complexity results and applications (Q628752) (← links)
- Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
- Compromise solutions for robust combinatorial optimization with variable-sized uncertainty (Q1750469) (← links)
- Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty (Q2125227) (← links)
- Recoverable robust representatives selection problems with discrete budgeted uncertainty (Q2158008) (← links)
- Mixed uncertainty sets for robust combinatorial optimization (Q2192978) (← links)
- A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty (Q2257099) (← links)
- Two-stage combinatorial optimization problems under risk (Q2283029) (← links)
- Robust recoverable 0-1 optimization problems under polyhedral uncertainty (Q2424772) (← links)
- A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems (Q2441360) (← links)
- Solving two-stage robust optimization problems using a column-and-constraint generation method (Q2450689) (← links)
- A note on \(\Sigma_2^p\)-completeness of a robust binary linear program with binary uncertainty set (Q2661527) (← links)
- An active set algorithm for robust combinatorial optimization based on separation oracles (Q5919428) (← links)
- Recycling inequalities for robust combinatorial optimization with budget uncertainty (Q6085989) (← links)
- An inexact column-and-constraint generation method to solve two-stage robust optimization problems (Q6161289) (← links)
- Short paper -- A note on robust combinatorial optimization with generalized interval uncertainty (Q6168886) (← links)
