Pages that link to "Item:Q2257099"
From MaRDI portal
The following pages link to A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty (Q2257099):
Displaying 19 items.
- Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
- Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty (Q723948) (← links)
- A note on robustness tolerances for combinatorial optimization problems (Q765526) (← links)
- The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach (Q1738828) (← links)
- The multi-band robust knapsack problem -- a dynamic programming approach (Q1751135) (← links)
- Robust vehicle routing under uncertainty via branch-price-and-cut (Q2101653) (← links)
- A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization (Q2197476) (← links)
- Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty (Q2312326) (← links)
- A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems (Q2441360) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty (Q5003707) (← links)
- Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions (Q5106418) (← links)
- Soft robust solutions to possibilistic optimization problems (Q6057607) (← links)
- Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem (Q6062886) (← links)
- Recycling inequalities for robust combinatorial optimization with budget uncertainty (Q6085989) (← links)
- Short paper -- A note on robust combinatorial optimization with generalized interval uncertainty (Q6168886) (← links)
- Comparative analysis of linear programming relaxations for the robust knapsack problem (Q6170571) (← links)
- A branch and bound algorithm for robust binary optimization with budget uncertainty (Q6175705) (← links)
- Recoverable robust shortest path problem under interval budgeted uncertainty representations (Q6663971) (← links)
