The value function of an integer program
From MaRDI portal
Publication:3941194
DOI10.1007/BF01583794zbMath0482.90068OpenAlexW2008131758MaRDI QIDQ3941194
C. E. Blair, Robert G. Jeroslow
Publication date: 1982
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01583794
Related Items
Approximating the stability region for binary mixed-integer programs, Representability in mixed integer programming. I: Characterization results, Parametric methods in integer linear programming, Generating functions and duality for integer programs, A discrete Farkas lemma, A shadow price in integer programming for management decision, A unified approach for price directive decomposition procedures in integer programming, A closed-form representation of mixed-integer program value functions, The Gap Function: Evaluating Integer Programming Models over Multiple Right-Hand Sides, Marginal values in mixed integer linear programming, Constructing the value function for an integer linear programme over a cone, Discrete subadditive functions as Gomory functions, Convex analysis in groups and semigroups: a sampler, Theorems of the alternative for conic integer programming, Stochastic and risk management models and solution algorithm for natural gas transmission network expansion and LNG terminal location planning, Evaluating mixed-integer programming models over multiple right-hand sides, Fenchel decomposition for stochastic mixed-integer programming, Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions—Modeling Implications, Two-stage quadratic integer programs with stochastic right-hand sides, Recent Progress in Two-stage Mixed-integer Stochastic Programming with Applications to Power Production Planning, Integer set reduction for stochastic mixed-integer programming, A decomposition approach to the two-stage stochastic unit commitment problem, Sensitivity theorems in integer linear programming, Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function, Mixed-integer bilevel representability, Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs, Decomposing finitely generated integral monoids by elimination, Exact augmented Lagrangian duality for mixed integer linear programming, Certificates of optimality for mixed integer linear programming using generalized subadditive generator functions, Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights, Integer programming as projection, Some cut-generating functions for second-order conic sets, Weyl-minkowski duality for integarl monoids*, Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming, Pre-disaster investment decisions for strengthening a highway network, Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach, On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables, The structure of an integral monoid and integer programming feasibility, A polyhedral characterization of the inverse-feasible region of a mixed-integer program, Two-stage robust mixed integer programming problem with objective uncertainty, Decomposing inventory routing problems with approximate value functions, Superadditive characterizations of pure integer programming feasibility, Some concepts of stability analysis in combinatorial optimization, The constraints of the group of an integral monoid, A Gilmore-Gomory construction of integer programming value functions, L-shaped decomposition of two-stage stochastic programs with integer recourse, Duality in mathematics and linear and integer programming, Standard pairs and group relaxations in integer programming, The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification, An inexact programming approach for urban electric power systems management under random-interval-parameter uncertainty, Parameterisation algorithms for the integer linear programs in binary variables, A framework for generalized Benders' decomposition and its application to multilevel optimization, A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs, Constructive characterizations of the value-function of a mixed-integer program. I, STOCHASTIC INTEGER PROGRAMMING BY DYNAMIC PROGRAMMING, A primal dual integer programming algorithm, Constructive characterizations of the value function of a mixed-integer program. II, On abstract duality in mathematical programming
Cites Work
- Unnamed Item
- Unnamed Item
- The value function of a mixed integer program: I
- Cutting-plane theory: Algebraic methods
- Some polyhedra related to combinatorial problems
- Edmonds polytopes and a hierarchy of combinatorial problems
- Minimal inequalities
- On Cutting Planes
- Integer programming duality: Price functions and sensitivity analysis
- On the existence of optimal solutions to integer and mixed-integer programming problems
- On the foundations of linear and integer linear programming I
- Some Basis Theorems for Integral Monoids
- Some continuous functions related to corner polyhedra
