SSLP

Stochastic Mixed-Integer Programming Test Problems: SSCH Test Set: The SSCH suite consists of 10 instances of two-stage strategic supply chain planning problems under uncertainty by Alonso-Ayuso et al. [5] with random recourse. The instances have pure binary first-stage variables, mixed-binary second-stage variables, fixed recourse and discrete distributions. Contributed by: Antonio Alonso-Ayuso. The instances were converted to SMPS format by Lewis Ntaimo and computational results reported in Ntaimo and Sen[3] and Ntaimo and Tanner [4]. Note: We could not induce relatively complete recourse in instances c6 and c9. SSLPR Test Set 1: The SSLPR suite consists of 90 (3 replications per instance size) instances of two-stage stochastic server location problems with random recourse [2]. The instances have pure binary first-stage variables, mixed-binary second-stage variables, fixed tenders, fixed RHS vector and discrete distributions. Contributed by: Lewis Ntaimo. SSLPR Test Set 2: The SSLP suite consists of 70 (5 replications per instance size) instances of two-stage stochastic server location problems [1] with replications. The instances have pure binary first-stage variables, mixed-binary second-stage variables, and discrete distributions. Contributed by: Lewis Ntaimo. SSLP Test Set 1: The SSLP suite consists of 12 instances of a two-stage stochastic mixed-integer programs arising in server location under uncertainty [1]. The instances have pure binary first-stage variables, mixed-binary second-stage variables, and discrete distributions. Contributed by: Lewis Ntaimo and Suvrajeet Sen. Also available at SIPLIB: SSLP Test Set 1

References in zbMATH (referenced in 1 article )

Showing result 1 of 1.
Sorted by year (citations)

  1. Angulo, Gustavo; Ahmed, Shabbir; Dey, Santanu S.: Improving the integer L-shaped method (2016)