Decomposition of test sets in stochastic integer programming

DOI10.1007/S10107-002-0322-1zbMath1030.90073OpenAlexW2061272534MaRDI QIDQ1411618

Rüdiger Schultz, Raymond Hemmecke

Publication date: 29 October 2003

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: http://edoc.hu-berlin.de/18452/8904

Mathematics Subject Classification ID

Integer programming (90C10) Stochastic programming (90C15) Decomposition methods (49M27)

Related Items (17)

About the Complexity of Two-Stage Stochastic IPs ⋮ An improved test set approach to nonlinear integer problems with applications to engineering design ⋮ A polynomial oracle-time algorithm for convex integer minimization ⋮ Block-structured integer programming: can we parameterize without the largest coefficient? ⋮ \(n\)-fold integer programming in cubic time ⋮ Integer set reduction for stochastic mixed-integer programming ⋮ The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints ⋮ A progressive hedging based branch-and-bound algorithm for mixed-integer stochastic programs ⋮ Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights ⋮ Graver basis and proximity techniques for block-structured separable convex integer minimization problems ⋮ Duality gaps in nonconvex stochastic optimization ⋮ Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach ⋮ The double exponential runtime is tight for 2-stage stochastic ILPs ⋮ The double exponential runtime is tight for 2-stage stochastic ILPs ⋮ Parameterized resiliency problems ⋮ A note on constraint aggregation and value functions for two-stage stochastic integer programs ⋮ About the complexity of two-stage stochastic IPs

This page was built for publication: Decomposition of test sets in stochastic integer programming