Pages that link to "Item:Q1411618"
From MaRDI portal
The following pages link to Decomposition of test sets in stochastic integer programming (Q1411618):
Displaying 17 items.
- A polynomial oracle-time algorithm for convex integer minimization (Q623465) (← links)
- An improved test set approach to nonlinear integer problems with applications to engineering design (Q887181) (← links)
- Duality gaps in nonconvex stochastic optimization (Q1764248) (← links)
- \(n\)-fold integer programming in cubic time (Q1942262) (← links)
- A progressive hedging based branch-and-bound algorithm for mixed-integer stochastic programs (Q1989733) (← links)
- About the complexity of two-stage stochastic IPs (Q2118129) (← links)
- The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints (Q2238737) (← links)
- Graver basis and proximity techniques for block-structured separable convex integer minimization problems (Q2248743) (← links)
- Parameterized resiliency problems (Q2330129) (← links)
- A note on constraint aggregation and value functions for two-stage stochastic integer programs (Q2339848) (← links)
- Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach (Q2502202) (← links)
- Block-structured integer programming: can we parameterize without the largest coefficient? (Q2684049) (← links)
- Integer set reduction for stochastic mixed-integer programming (Q2701423) (← links)
- Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights (Q3565463) (← links)
- About the Complexity of Two-Stage Stochastic IPs (Q5041750) (← links)
- The double exponential runtime is tight for 2-stage stochastic ILPs (Q5918430) (← links)
- The double exponential runtime is tight for 2-stage stochastic ILPs (Q5925653) (← links)