The value function of an integer program
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3580570 (Why is no real title available?)
- scientific article; zbMATH DE number 3373541 (Why is no real title available?)
- Cutting-plane theory: Algebraic methods
- Edmonds polytopes and a hierarchy of combinatorial problems
- Integer programming duality: Price functions and sensitivity analysis
- Minimal inequalities
- On Cutting Planes
- 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
- Some polyhedra related to combinatorial problems
- The value function of a mixed integer program: I
Cited in
(62)- 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
- Parametric methods in integer linear programming
- Convex analysis in groups and semigroups: a sampler
- A primal dual integer programming algorithm
- Approximating the stability region for binary mixed-integer programs
- An inexact programming approach for urban electric power systems management under random-interval-parameter uncertainty
- Marginal values in mixed integer linear programming
- A unified approach for price directive decomposition procedures in integer programming
- Solving stochastic and bilevel mixed-integer programs via a generalized value function
- Representability in mixed integer programming. I: Characterization results
- Weyl-minkowski duality for integarl monoids*
- Sparsity and integrality gap transference bounds for integer programs
- A discrete Farkas lemma
- Pre-disaster investment decisions for strengthening a highway network
- STOCHASTIC INTEGER PROGRAMMING BY DYNAMIC PROGRAMMING
- Duality in mathematics and linear and integer programming
- Integer set reduction for stochastic mixed-integer programming
- Certificates of optimality for mixed integer linear programming using generalized subadditive generator functions
- Two-stage quadratic integer programs with stochastic right-hand sides
- Integer programming as projection
- Some cut-generating functions for second-order conic sets
- Mixed-integer linear representability, disjunctions, and Chvátal functions -- modeling implications
- Evaluating mixed-integer programming models over multiple right-hand sides
- Two-stage stochastic mixed-integer programs: algorithms and insights
- Parameterisation algorithms for the integer linear programs in binary variables
- Constructive characterizations of the value-function of a mixed-integer program. I
- The gap function: evaluating integer programming models over multiple right-hand sides
- Recent Progress in Two-stage Mixed-integer Stochastic Programming with Applications to Power Production Planning
- The structure of an integral monoid and integer programming feasibility
- Stochastic and risk management models and solution algorithm for natural gas transmission network expansion and LNG terminal location planning
- On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem
- Superadditive characterizations of pure integer programming feasibility
- Constructing the value function for an integer linear programme over a cone
- Generating functions and duality for integer programs
- Sparsity and proximity transference in integer programming
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- Some concepts of stability analysis in combinatorial optimization
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
- On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables
- Decomposing finitely generated integral monoids by elimination
- Two-stage robust mixed integer programming problem with objective uncertainty
- A decomposition approach to the two-stage stochastic unit commitment problem
- A polyhedral characterization of the inverse-feasible region of a mixed-integer program
- A Gilmore-Gomory construction of integer programming value functions
- A shadow price in integer programming for management decision
- Standard pairs and group relaxations in integer programming
- Mixed-integer bilevel representability
- The constraints of the group of an integral monoid
- On abstract duality in mathematical programming
- Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
- Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
- Sensitivity theorems in integer linear programming
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- Theorems of the alternative for conic integer programming
- Exact augmented Lagrangian duality for mixed integer linear programming
- Solving a class of two-stage stochastic nonlinear integer programs using value functions
- Constructive characterizations of the value function of a mixed-integer program. II
- Decomposing inventory routing problems with approximate value functions
- Discrete subadditive functions as Gomory functions
- Fenchel decomposition for stochastic mixed-integer programming
- A closed-form representation of mixed-integer program value functions
This page was built for publication: The value function of an integer program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3941194)
