Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
From MaRDI portal
Publication:2452371
DOI10.1007/S10107-012-0615-YzbMATH Open1291.90143OpenAlexW2135791976MaRDI QIDQ2452371FDOQ2452371
Authors: Dinakar Gade, Simge Küçükyavuz, Suvrajeet Sen 
Publication date: 2 June 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-012-0615-y
Recommendations
- Finitely convergent decomposition algorithms for two-stage stochastic pure integer programs
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
- Two-stage stochastic mixed-integer programs: algorithms and insights
- scientific article; zbMATH DE number 1688600
finite convergenceBenders' decompositionGomory cutslexicographic dual simplex\(L\)-shaped methodtwo-stage stochastic integer programs
Cites Work
- SCIP: solving constraint integer programs
- Partitioning procedures for solving mixed-variables programming problems
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
- On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables
- Title not available (Why is that?)
- A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
- A multicut algorithm for two-stage stochastic linear programs
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Some polyhedra related to combinatorial problems
- Gomory cuts revisited
- Introduction to stochastic programming.
- Minimal valid inequalities for integer constraints
- Outline of an algorithm for integer solutions to linear programs
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- A finite branch-and-bound algorithm for two-stage stochastic integer programs
- The million-variable ``march for stochastic combinatorial optimization
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- Disjunctive decomposition for two-stage stochastic mixed-binary programs with random recourse
- Continuity Properties of Expectation Functions in Stochastic Integer Programming
- Algorithms for stochastic mixed-integer programming models
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Edmonds polytopes and a hierarchy of combinatorial problems
- Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
- Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions
- Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
- The value function of an integer program
- Lexicography and degeneracy: Can a pure cutting plane algorithm work?
- An upper bound on the number of cuts needed in Gomory's method of integer forms
- Some complexity results for polynomial ideals
- Enhanced cut generation methods for decomposition-based branch and cut for two-stage stochastic mixed-integer programs
- Title not available (Why is that?)
- On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs
- A comparative study of decomposition algorithms for stochastic combinatorial optimization
- A cutting-plane approach to mixed 0-1 stochastic integer programs
Cited In (51)
- Integrated Backup Rolling Stock Allocation and Timetable Rescheduling with Uncertain Time-Variant Passenger Demand Under Disruptive Events
- A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs
- Higher-order total variation bounds for expectations of periodic functions and simple integer recourse approximations
- Tight second stage formulations in two-stage stochastic mixed integer programs
- An integer decomposition algorithm for solving a two-stage facility location problem with second-stage activation costs
- An L-shaped method with strengthened lift-and-project cuts
- Improving the integer L-shaped method
- Pseudo-valid cutting planes for two-stage mixed-integer stochastic programs with right-hand-side uncertainty
- Finitely convergent decomposition algorithms for two-stage stochastic pure integer programs
- On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs
- A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs
- About the complexity of two-stage stochastic IPs
- Nonlinear chance-constrained problems with applications to hydro scheduling
- Towards a sustainable power grid: stochastic hierarchical planning for high renewable integration
- A loose Benders decomposition algorithm for approximating two-stage mixed-integer recourse models
- Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing
- Integer set reduction for stochastic mixed-integer programming
- A progressive hedging based branch-and-bound algorithm for mixed-integer stochastic programs
- Cutting planes for the multistage stochastic unit commitment problem
- An approximation framework for two-stage ambiguous stochastic integer programs under mean-MAD information
- Two-stage stochastic mixed-integer programs: algorithms and insights
- A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables
- Optimal crashing of an activity network with disruptions
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
- On solving two-stage distributionally robust disjunctive programs with a general ambiguity set
- Logic-Based Benders Decomposition and Binary Decision Diagram Based Approaches for Stochastic Distributed Operating Room Scheduling
- A two-stage stochastic programming approach for influence maximization in social networks
- A unified framework for multistage mixed integer linear optimization
- A two-stage stochastic integer programming approach to integrated staffing and scheduling with application to nurse management
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
- A repeated route-then-schedule approach to coordinated vehicle platooning: algorithms, valid inequalities and computation
- Algorithms for stochastic mixed-integer programming models
- Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
- Title not available (Why is that?)
- Disjunctive decomposition for two-stage stochastic mixed-binary programs with random recourse
- Stochastic programming analysis and solutions to schedule overcrowded operating rooms in China
- Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs
- Decomposition methods for global solution of mixed-integer linear programs
- Decomposition of test sets in stochastic integer programming
- A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables
- Partition-based decomposition algorithms for two-stage stochastic integer programs with continuous recourse
- About the Complexity of Two-Stage Stochastic IPs
- Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs
- The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness
- Stochastic planning and scheduling with logic-based Benders decomposition
- Convex approximations for two-stage mixed-integer mean-risk recourse models with conditional value-at-risk
- Unified branch-and-Benders-cut for two-stage stochastic mixed-integer programs
- Algorithm for the N-2 Security-Constrained Unit Commitment Problem with Transmission Switching
- A solution algorithm for chance-constrained problems with integer second-stage recourse decisions
Uses Software
This page was built for publication: Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2452371)
