Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function (Q5129216): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 16:03, 30 December 2024

scientific article; zbMATH DE number 7266029

Language	Label	Description	Also known as
English	Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function	scientific article; zbMATH DE number 7266029

Statements

scholarly article

0 references

Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function (English)

0 references

Onur Tavaslıoğlu

0 references

Oleg A. Prokopyev

0 references

Andrew J. Schaefer

0 references

Operations Research

0 references

publication date

26 October 2020

0 references

zbMATH Keywords

stochastic programming

0 references

mixed integer programming

0 references

global branch and bound

0 references

two-stage mixed integer programming

0 references

bilevel programming

0 references

multifollower bilevel programming

0 references

MaRDI profile type

0 references

full work available at URL

https://doi.org/10.1287/opre.2019.1842

0 references

A multi-stage stochastic integer programming approach for capacity expansion under uncertainty

0 references

A finite branch-and-bound algorithm for two-stage stochastic integer programs

0 references

An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming

0 references

A stochastic 0-1 program based approach for the air traffic flow management problem

0 references

0 references

Exact solution approach for a class of nonlinear bilevel knapsack problems

0 references

State-of-the-Art-Survey—Stochastic Programming: Computation and Applications

0 references

Introduction to Stochastic Programming

0 references

A brief history of linear and mixed-integer programming computation

0 references

A closed-form representation of mixed-integer program value functions

0 references

The value function of an integer program

0 references

Constructive characterizations of the value-function of a mixed-integer program. I

0 references

Constructive characterizations of the value function of a mixed-integer program. II

0 references

Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse

0 references

A dynamic programming algorithm for the bilevel Knapsack problem

0 references

One-level reformulation of the bilevel Knapsack problem using dynamic programming

0 references

Linear bilevel multi-follower programming with independent followers

0 references

Dual decomposition in stochastic integer programming

0 references

A cutting-plane approach to mixed 0-1 stochastic integer programs

0 references

L-shaped decomposition of two-stage stochastic programs with integer recourse

0 references

An overview of bilevel optimization

0 references

Optimizing Frequencies in a Transit Network: a Nonlinear Bi‐level Programming Approach

0 references

Sensitivity theorems in integer linear programming

0 references

Linear Programming under Uncertainty

0 references

Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming

0 references

The Theory and Computation of Knapsack Functions

0 references

0 references

0 references

New Branch-and-Bound Rules for Linear Bilevel Programming

0 references

0 references

A stochastic programming approach for planning horizons of infinite horizon capacity planning problems

0 references

The polynomial hierarchy and a simple model for competitive analysis

0 references

Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints

0 references

Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach

0 references

A polyhedral characterization of the inverse-feasible region of a mixed-integer program

0 references

The integer \(L\)-shaped method for stochastic integer programs with complete recourse

0 references

Bilevel programming and the separation problem

0 references

Weak via strong Stackelberg problem: New results

0 references

Stochastic programming with simple integer recourse

0 references

On bilevel multi-follower decision making: general framework and solutions

0 references

A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems

0 references

0 references

Linear bilevel programming with upper level constraints depending on the lower level solution

0 references

The Mixed Integer Linear Bilevel Programming Problem

0 references

0 references

Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Random Recourse

0 references

Fenchel decomposition for stochastic mixed-integer programming

0 references

A comparative study of decomposition algorithms for stochastic combinatorial optimization

0 references

The bilevel knapsack problem with stochastic right-hand sides

0 references

Two-stage quadratic integer programs with stochastic right-hand sides

0 references

Optimizing the Societal Benefits of the Annual Influenza Vaccine: A Stochastic Programming Approach

0 references

The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming

0 references

Sensitivity Analysis for Branch and Bound Integer Programming

0 references

Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions

0 references

0 references

The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification

0 references

Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming

0 references

A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse

0 references

Two-stage stochastic hierarchical multiple risk problems: Models and algorithms

0 references

Stackelberg-Nash-Cournot Equilibria: Characterizations and Computations

0 references

On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables

0 references

Variation of cost functions in integer programming

0 references

A class of algorithms for mixed-integer bilevel min-max optimization

0 references

A note on constraint aggregation and value functions for two-stage stochastic integer programs

0 references

On a Level-Set Characterization of the Value Function of an Integer Program and Its Application to Stochastic Programming

0 references

Directed perturbation analysis of an integer program

0 references

Structural approach to parametric analysis of an IP. On the case of the right-hand side

0 references

Constructing the value function for an integer linear programme over a cone

0 references

Integer programming duality: Price functions and sensitivity analysis

0 references

A two-stage stochastic programming approach for influence maximization in social networks

0 references

An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions

0 references

Enhanced Cut Generation Methods for Decomposition-Based Branch and Cut for Two-Stage Stochastic Mixed-Integer Programs

0 references

Partially-shared pessimistic bilevel multi-follower programming: concept, algorithm, and application

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

10.1287/OPRE.2019.1842

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5129216

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5129216&oldid=39539926"