Two stage linear programming under uncertainty with 0–1 integer first stage variables
From MaRDI portal
(Redirected from Publication:3885534)
Cites work
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- An Improved Implicit Enumeration Approach for Integer Programming
- Direct Search Algorithms for Zero-One and Mixed-Integer Programming
- scientific article; zbMATH DE number 3169929 (Why is no real title available?)
- scientific article; zbMATH DE number 3410784 (Why is no real title available?)
- Investment in stochastic minimum cost generalized multicommodity networks with application to coal transport
- Partitioning procedures for solving mixed-variables programming problems
- Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program
- The Cutting-Plane Method for Solving Convex Programs
Cited in
(21)- Modeling supplier selection and the use of option contracts for global supply chain design
- Risk-averse formulations and methods for a virtual power plant
- Measuring and maximizing resilience of freight transportation networks
- Fenchel decomposition for stochastic mixed-integer programming
- Adaptive cultural algorithm-based cuckoo search for time-dependent vehicle routing problem with stochastic customers using adaptive fractional Kalman speed prediction
- Accelerated sample average approximation method for two-stage stochastic programming with binary first-stage variables
- A decomposition approach for solving a broadcast domination network design problem
- Exact solutions to a class of stochastic generalized assignment problems
- Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- Integer set reduction for stochastic mixed-integer programming
- Hierarchical benders decomposition for open-pit mine block sequencing
- A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem
- A two-stage stochastic integer programming model for a thermal power system expansion
- Minimizing a stochastic maximum-reliability path
- Two-stage stochastic mixed-integer programs: algorithms and insights
- An integer decomposition algorithm for solving a two-stage facility location problem with second-stage activation costs
- Two‐stage stochastic integer programming: a survey
- The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- A nonlinear bilevel model for analysis of electric utility demand-side planning issues
This page was built for publication: Two stage linear programming under uncertainty with 0–1 integer first stage variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3885534)
