A Gilmore-Gomory construction of integer programming value functions
From MaRDI portal
Publication:2060593
DOI10.1016/j.orl.2021.04.008OpenAlexW3164214753MaRDI QIDQ2060593
Wenxin Zhang, Seth Brown, Temitayo Ajayi, Andrew J. Schaefer
Publication date: 13 December 2021
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.10223
Cites Work
- Unnamed Item
- Two-stage quadratic integer programs with stochastic right-hand sides
- Approximating the stability region for binary mixed-integer programs
- The value function of a mixed integer program: I
- Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions
- A primal dual integer programming algorithm
- A finite branch-and-bound algorithm for two-stage stochastic integer programs
- A closed-form representation of mixed-integer program value functions
- Constructing the value function for an integer linear programme over a cone
- Mixed-integer bilevel representability
- A note on constraint aggregation and value functions for two-stage stochastic integer programs
- Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
- Integer programming duality: Price functions and sensitivity analysis
- The value function of an integer program
- A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem
- The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem
- Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function
- On a Level-Set Characterization of the Value Function of an Integer Program and Its Application to Stochastic Programming
- The Theory and Computation of Knapsack Functions