Pages that link to "Item:Q2392865"
From MaRDI portal
The following pages link to Cutting plane versus compact formulations for uncertain (integer) linear programs (Q2392865):
Displaying 41 items.
- On the recoverable robust traveling salesman problem (Q331985) (← links)
- Exact solution of the robust knapsack problem (Q336592) (← links)
- Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios (Q513625) (← links)
- Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (Q744205) (← links)
- RENS. The optimal rounding (Q744216) (← links)
- Revisiting wireless network jamming by SIR-based considerations and multiband robust optimization (Q895758) (← links)
- Improved handling of uncertainty and robustness in set covering problems (Q1695010) (← links)
- Thinning out Steiner trees: a node-based model for uniform edge costs (Q1699615) (← links)
- The multi-band robust knapsack problem -- a dynamic programming approach (Q1751135) (← links)
- Robust multicovers with budgeted uncertainty (Q1755380) (← links)
- Robust min-max regret covering problems (Q2162527) (← links)
- An exact method for constrained maximization of the conditional value-at-risk of a class of stochastic submodular functions (Q2183220) (← links)
- Robust strategic planning for mobile medical units with steerable and unsteerable demands (Q2239842) (← links)
- A relative robust approach on expected returns with bounded CVaR for portfolio selection (Q2239973) (← links)
- Approximate cutting plane approaches for exact solutions to robust optimization problems (Q2301927) (← links)
- Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem (Q2329707) (← links)
- Exact approaches for solving robust prize-collecting Steiner tree problems (Q2355891) (← links)
- Chance-constrained set covering with Wasserstein ambiguity (Q2687060) (← links)
- Multistage adaptive robust optimization for the unit commitment problem (Q2806056) (← links)
- A dynamic programming approach for a class of robust optimization problems (Q2817842) (← links)
- Multistage robust mixed-integer optimization with adaptive partitions (Q2830769) (← links)
- Duality in two-stage adaptive linear optimization: faster computation and stronger bounds (Q2830953) (← links)
- Robust Network Design with Uncertain Outsourcing Cost (Q3458750) (← links)
- Probabilistic Partial Set Covering with an Oracle for Chance Constraints (Q4629339) (← links)
- Exploiting the Structure of Two-Stage Robust Optimization Models with Exponential Scenarios (Q4995062) (← links)
- Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems (Q5058013) (← links)
- Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions (Q5106418) (← links)
- A New Theoretical Framework for Robust Optimization Under Multi-Band Uncertainty (Q5171786) (← links)
- Projective Cutting-Planes (Q5221062) (← links)
- Robust network design: Formulations, valid inequalities, and computations (Q5326784) (← links)
- A survey of nonlinear robust optimization (Q5882395) (← links)
- Deriving compact extended formulations via LP-based separation techniques (Q5892024) (← links)
- Deriving compact extended formulations via LP-based separation techniques (Q5925168) (← links)
- Recycling inequalities for robust combinatorial optimization with budget uncertainty (Q6085989) (← links)
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness (Q6114933) (← links)
- An effective global algorithm for worst-case linear optimization under polyhedral uncertainty (Q6166102) (← 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)
- An oracle-based framework for robust combinatorial optimization (Q6183084) (← links)
- Approach for multi-valued integer programming in multi-material topology optimization: random discrete steepest descent (RDSD) algorithm (Q6643610) (← links)
