Pages that link to "Item:Q2502200"

The following pages link to Strong formulations of robust mixed 0-1 programming (Q2502200):

Displaying 28 items.

• Application of robust optimization to automated test assembly (Q363604) (← links)
• Almost robust discrete optimization (Q666949) (← links)
• Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
• Two-stage robust mixed integer programming problem with objective uncertainty (Q723485) (← links)
• A conditional logic approach for strengthening mixed 0-1 linear programs (Q817194) (← links)
• Compact formulations as a union of polyhedra (Q927156) (← links)
• Polymatroids and mean-risk minimization in discrete optimization (Q957370) (← links)
• A robust approach to the chance-constrained knapsack problem (Q957372) (← links)
• Valid inequalities for mixed integer linear programs (Q995784) (← links)
• A capacitated hub location problem under hose demand uncertainty (Q1651522) (← links)
• The multi-band robust knapsack problem -- a dynamic programming approach (Q1751135) (← links)
• Robust portfolio selection for index tracking (Q1762050) (← links)
• Robust integer programming (Q1785307) (← links)
• Robust binary optimization using a safe tractable approximation (Q1785400) (← links)
• Strong IP formulations need large coefficients (Q2019425) (← links)
• Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity (Q2097654) (← links)
• Robust and reliable portfolio optimization formulation of a chance constrained problem (Q2360112) (← links)
• Robust recoverable 0-1 optimization problems under polyhedral uncertainty (Q2424772) (← links)
• On mixing sets arising in chance-constrained programming (Q2429465) (← links)
• 2-stage robust MILP with continuous recourse variables (Q2449080) (← links)
• Strong valid inequalities for orthogonal disjunctions and bilinear covering sets (Q2638385) (← links)
• Cover inequalities for robust knapsack sets -- application to the robust bandwidth packing problem (Q2892146) (← links)
• The Mixing Set with Divisible Capacities (Q3503864) (← links)
• Stronger formulations of mixed integer linear programs: an example (Q4378103) (← links)
• (Q4998944) (← links)
• Recycling inequalities for robust combinatorial optimization with budget uncertainty (Q6085989) (← 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)