A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs

DOI10.1007/S10107-018-1315-ZzbMATH Open1489.90086OpenAlexW2887383021WikidataQ129359135 ScholiaQ129359135MaRDI QIDQ2118082FDOQ2118082

J. Cole Smith, Leonardo Lozano

Publication date: 22 March 2022

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

Full work available at URL: https://doi.org/10.1007/s10107-018-1315-z

Recommendations

• Stochastic dual dynamic integer programming
• Disjunctive decomposition for two-stage stochastic mixed-binary programs with generalized upper bound constraints
• A finite branch-and-bound algorithm for two-stage stochastic integer programs
• A general algorithm for solving two-stage stochastic mixed \(0-1\) first-stage problems
• Stochastic programs with binary distributions: structural properties of scenario trees and algorithms

zbMATH Keywords

integer programmingtwo-stage stochastic programmingBenders' decompositionbinary decision diagrams

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
• Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
• An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: some theoretical and experimental aspects
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• The prize collecting traveling salesman problem
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
• A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
• Dual decomposition in stochastic integer programming
• Discrete optimization with decision diagrams
• Multivalued Decision Diagrams for Sequencing Problems
• Stochastic integer programming: general models and algorithms
• L-shaped decomposition of two-stage stochastic programs with integer recourse
• Stochastic programming with integer variables
• Convex approximations for complete integer recourse models
• A finite branch-and-bound algorithm for two-stage stochastic integer programs
• Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
• The million-variable ``march for stochastic combinatorial optimization
• Simple integer recourse models: convexity and convex approximations
• The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
• A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems
• 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
• Binary Decision Diagrams
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Two-stage stochastic hierarchical multiple risk problems: Models and algorithms
• An MDD Approach to Multidimensional Bin Packing
• Decision Diagrams and Dynamic Programming
• 0/1 vertex and facet enumeration with BDDs
• Title not available (Why is that?)
• Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions
• Experimental and Efficient Algorithms
• The time-dependent capacitated profitable tour problem with time windows and precedence constraints

Cited In (4)

• Special issue: topics in stochastic programming
• Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
• Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams
• Decision Diagrams for Discrete Optimization: A Survey of Recent Advances

This page was built for publication: A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118082)