Pages that link to "Item:Q668950"
From MaRDI portal
The following pages link to Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950):
Displaying 39 items.
- Robust combinatorial optimization with variable cost uncertainty (Q296586) (← links)
- Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty (Q723948) (← links)
- A note on robustness tolerances for combinatorial optimization problems (Q765526) (← links)
- Combinatorial optimization under uncertainty (Q1008321) (← links)
- Compromise solutions for robust combinatorial optimization with variable-sized uncertainty (Q1750469) (← links)
- On scenario aggregation to approximate robust combinatorial optimization problems (Q1800442) (← links)
- Oracle-based algorithms for binary two-stage robust optimization (Q2023665) (← links)
- Solving robust two-stage combinatorial optimization problems under convex uncertainty (Q2050273) (← links)
- On the complexity of robust bilevel optimization with uncertain follower's objective (Q2060358) (← links)
- Optimizing subscriber migrations for a telecommunication operator in uncertain context (Q2076939) (← links)
- Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty (Q2125227) (← links)
- The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective (Q2154452) (← links)
- Mixed uncertainty sets for robust combinatorial optimization (Q2192978) (← links)
- A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization (Q2197476) (← links)
- Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty (Q2197489) (← links)
- Discrete optimization methods for group model selection in compressed sensing (Q2235146) (← links)
- Dominance-based linear formulation for the anchor-robust project scheduling problem (Q2239841) (← links)
- Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty (Q2312326) (← links)
- A note on \(\Sigma_2^p\)-completeness of a robust binary linear program with binary uncertainty set (Q2661527) (← links)
- An approach to the distributionally robust shortest path problem (Q2668652) (← links)
- Pareto robust optimization on Euclidean vector spaces (Q2693797) (← links)
- On the multistage shortest path problem under distributional uncertainty (Q2697006) (← links)
- Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets (Q4962207) (← links)
- Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty (Q5046625) (← links)
- Radius of Robust Feasibility for Mixed-Integer Problems (Q5084649) (← links)
- Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions (Q5106418) (← links)
- Recoverable Robust Combinatorial Optimization Problems (Q5171791) (← links)
- Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback (Q5868922) (← links)
- An exact algorithm for robust influence maximization (Q5918920) (← links)
- An active set algorithm for robust combinatorial optimization based on separation oracles (Q5919428) (← links)
- Robust Optimization with Continuous Decision-Dependent Uncertainty with applications to demand response management (Q6053589) (← links)
- Recycling inequalities for robust combinatorial optimization with budget uncertainty (Q6085989) (← links)
- Data-driven robust optimization using deep neural networks (Q6109292) (← links)
- Short paper -- A note on robust combinatorial optimization with generalized interval uncertainty (Q6168886) (← links)
- Minimizing recovery cost of network optimization problems (Q6179707) (← links)
- An oracle-based framework for robust combinatorial optimization (Q6183084) (← links)
- Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints (Q6202946) (← links)
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023 (Q6544493) (← links)
- Approximation guarantees for min-max-min robust optimization and \(k\)-adaptability under objective uncertainty (Q6561382) (← links)
