Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs
From MaRDI portal
Publication:4609472
DOI10.1137/16M1083955zbMath1395.90185OpenAlexW2738145410MaRDI QIDQ4609472
Manish Bansal, Kuo-Ling Huang, Sanjay Mehrotra
Publication date: 3 April 2018
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/16m1083955
convex hulldiscrete lot-sizingparametric cutscapacitated lot-sizing with backloggingcontinuous multi-mixing settight extended formulationtwo-stage stochastic mixed integer program
Related Items
Discrete multi-module capacitated lot-sizing problems with multiple items, Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs, Convex approximations for two-stage mixed-integer mean-risk recourse models with conditional value-at-risk, Facets for single module and multi-module capacitated lot-sizing problems without backlogging, Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs, A loose Benders decomposition algorithm for approximating two-stage mixed-integer recourse models, Facets for continuous multi-mixing set with general coefficients and bounded integer variables, Pseudo-Valid Cutting Planes for Two-Stage Mixed-Integer Stochastic Programs with Right-Hand-Side Uncertainty, On solving two-stage distributionally robust disjunctive programs with a general ambiguity set, A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem
- Adaptive multicut aggregation for two-stage stochastic linear programs with recourse
- A comparative study of decomposition algorithms for stochastic combinatorial optimization
- Partitioning procedures for solving mixed-variables programming problems
- A cutting-plane approach to mixed 0-1 stochastic integer programs
- Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions
- Tight formulations for some simple mixed integer programs and convex objective integer programs
- Facets for continuous multi-mixing set with general coefficients and bounded integer variables
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- A finite branch-and-bound algorithm for two-stage stochastic integer programs
- Totally unimodular stochastic programs
- Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method
- On mixing sets arising in chance-constrained programming
- Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
- The million-variable ``march for stochastic combinatorial optimization
- Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
- On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- A Two-Stage Stochastic Integer Programming Approach to Integrated Staffing and Scheduling with Application to Nurse Management
- Recent Progress in Two-stage Mixed-integer Stochastic Programming with Applications to Power Production Planning
- Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Random Recourse
- Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems
- Introduction to Stochastic Programming
- Finitely Convergent Decomposition Algorithms for Two-Stage Stochastic Pure Integer Programs
- n-Step Cycle Inequalities: Facets for Continuous n-Mixing Set and Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem
- Nonlinear Programming
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- The Continuous Mixing Polyhedron
- Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse
- Mixing mixed-integer inequalities
