Solving stochastic and bilevel mixed-integer programs via a generalized value function
From MaRDI portal
Recommendations
- A value-function-based exact approach for the bilevel mixed-integer programming problem
- scientific article; zbMATH DE number 1953200
- Two-stage quadratic integer programs with stochastic right-hand sides
- On a level-set characterization of the value function of an integer program and its application to stochastic programming
- A unified framework for multistage mixed integer linear optimization
Cites work
- A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems
- A brief history of linear and mixed-integer programming computation
- A class of algorithms for mixed-integer bilevel min-max optimization
- A closed-form representation of mixed-integer program value functions
- A comparative study of decomposition algorithms for stochastic combinatorial optimization
- A cutting-plane approach to mixed 0-1 stochastic integer programs
- A dynamic programming algorithm for the bilevel Knapsack problem
- A finite branch-and-bound algorithm for two-stage stochastic integer programs
- A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
- A multi-stage stochastic integer programming approach for capacity expansion under uncertainty
- A note on constraint aggregation and value functions for two-stage stochastic integer programs
- A polyhedral characterization of the inverse-feasible region of a mixed-integer program
- A stochastic 0-1 program based approach for the air traffic flow management problem
- A stochastic programming approach for planning horizons of infinite horizon capacity planning problems
- A two-stage stochastic programming approach for influence maximization in social networks
- Algorithms for stochastic mixed-integer programming models
- An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- An overview of bilevel optimization
- Bilevel programming and the separation problem
- Constructing the value function for an integer linear programme over a cone
- Constructive characterizations of the value function of a mixed-integer program. II
- Constructive characterizations of the value-function of a mixed-integer program. I
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
- Directed perturbation analysis of an integer program
- Disjunctive decomposition for two-stage stochastic mixed-binary programs with generalized upper bound constraints
- Disjunctive decomposition for two-stage stochastic mixed-binary programs with random recourse
- Dual decomposition in stochastic integer programming
- Duality for mixed-integer linear programs
- Enhanced cut generation methods for decomposition-based branch and cut for two-stage stochastic mixed-integer programs
- Exact solution approach for a class of nonlinear bilevel knapsack problems
- Fenchel decomposition for stochastic mixed-integer programming
- scientific article; zbMATH DE number 3115465 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1349588 (Why is no real title available?)
- scientific article; zbMATH DE number 1114459 (Why is no real title available?)
- scientific article; zbMATH DE number 1488061 (Why is no real title available?)
- Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming
- Integer programming duality: Price functions and sensitivity analysis
- Introduction to stochastic programming.
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- Linear bilevel multi-follower programming with independent followers
- Linear bilevel programming with upper level constraints depending on the lower level solution
- Linear programming under uncertainty
- New Branch-and-Bound Rules for Linear Bilevel Programming
- On a level-set characterization of the value function of an integer program and its application to stochastic programming
- On bilevel multi-follower decision making: general framework and solutions
- On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables
- One-level reformulation of the bilevel Knapsack problem using dynamic programming
- Optimizing Frequencies in a Transit Network: a Nonlinear Bi‐level Programming Approach
- Optimizing the societal benefits of the annual influenza vaccine: a stochastic programming approach
- Partially-shared pessimistic bilevel multi-follower programming: concept, algorithm, and application
- Sensitivity Analysis for Branch and Bound Integer Programming
- Sensitivity theorems in integer linear programming
- Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions
- Stackelberg-Nash-Cournot Equilibria: Characterizations and Computations
- State-of-the-Art-Survey—Stochastic Programming: Computation and Applications
- Stochastic programming with simple integer recourse
- Strengthened benders cuts for stochastic integer programs with continuous recourse
- Structural approach to parametric analysis of an IP. On the case of the right-hand side
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming
- The bilevel knapsack problem with stochastic right-hand sides
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- The Mixed Integer Linear Bilevel Programming Problem
- The polynomial hierarchy and a simple model for competitive analysis
- The Theory and Computation of Knapsack Functions
- The value function of an integer program
- Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
- Two-stage quadratic integer programs with stochastic right-hand sides
- Two-stage stochastic hierarchical multiple risk problems: Models and algorithms
- Variation of cost functions in integer programming
- Weak via strong Stackelberg problem: New results
Cited in
(14)- A Gilmore-Gomory construction of integer programming value functions
- Scalable branching on dual decomposition of stochastic mixed-integer programming problems
- Mixed-integer bilevel representability
- A note on constraint aggregation and value functions for two-stage stochastic integer programs
- A value function-based approach for robust surgery planning
- A class of expected value bilevel programming problems with random coefficients based on rough approximation and its application to a production-inventory system
- scientific article; zbMATH DE number 1953200 (Why is no real title available?)
- Reduction of the bilevel stochastic optimization problem with quantile objective function to a mixed‐integer problem
- A unified framework for multistage mixed integer linear optimization
- Managing Product Transitions: A Bilevel Programming Approach
- Bilevel Integer Programs with Stochastic Right-Hand Sides
- Online Mixed-Integer Optimization in Milliseconds
- On a level-set characterization of the value function of an integer program and its application to stochastic programming
- Solving a class of two-stage stochastic nonlinear integer programs using value functions
This page was built for publication: Solving stochastic and bilevel mixed-integer programs via a generalized value function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5129216)
