Constructive characterizations of the value-function of a mixed-integer program. I
From MaRDI portal
Publication:798260
DOI10.1016/0166-218X(84)90022-2zbMATH Open0545.90079OpenAlexW4210397891MaRDI QIDQ798260FDOQ798260
Authors: C. E. Blair, Robert G. Jeroslow 
Publication date: 1984
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(84)90022-2
Recommendations
- A closed-form representation of mixed-integer program value functions
- Constructive characterizations of the value function of a mixed-integer program. II
- scientific article; zbMATH DE number 1953200
- Constructing the value function for an integer linear programme over a cone
- La valeur optimale des programmes entiers. (The optimal value of integer programs)
Cites Work
- Partitioning procedures for solving mixed-variables programming problems
- Some polyhedra related to combinatorial problems
- On the foundations of linear and integer linear programming I
- Title not available (Why is that?)
- Some continuous functions related to corner polyhedra, II
- Modelling with integer variables
- On the existence of optimal solutions to integer and mixed-integer programming problems
- Cutting-plane theory: Algebraic methods
- Minimal inequalities
- Edmonds polytopes and a hierarchy of combinatorial problems
- Integer programming duality: Price functions and sensitivity analysis
- On Cutting Planes
- Mixed integer minimization models for piecewise-linear functions of a single variable
- Integer and mixed-integer programming models: General properties
- An Exact Penalty Method for Mixed-Integer Programs
- The value function of an integer program
- The value function of a mixed integer program. II
- Some Basis Theorems for Integral Monoids
- Constructive characterizations of the value function of a mixed-integer program. II
- Title not available (Why is that?)
Cited In (18)
- A framework for generalized Benders' decomposition and its application to multilevel optimization
- Parametric methods in integer linear programming
- Optimality certificates for convex minimization and Helly numbers
- Solving stochastic and bilevel mixed-integer programs via a generalized value function
- Future paths for integer programming and links to artificial intelligence
- The value function of an infinite-horizon single-item lot-sizing problem
- Evaluating mixed-integer programming models over multiple right-hand sides
- On the Glivenko-Cantelli problem in stochastic programming: mixed-integer linear recourse.
- Lattice-free simplices with lattice width \(2d - o(d)\)
- On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem
- A unified framework for multistage mixed integer linear optimization
- Inference flexibility in Horn clause knowledge bases and the simplex method
- Local stability and differentiability of the mean-conditional value at risk model defined on the mixed-integer loss functions
- Chvátal closures for mixed integer programming problems
- Exact augmented Lagrangian duality for mixed integer convex optimization
- Constructive characterizations of the value function of a mixed-integer program. II
- A closed-form representation of mixed-integer program value functions
- Enumeration and unimodular equivalence of empty delta-modular simplices
This page was built for publication: Constructive characterizations of the value-function of a mixed-integer program. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798260)
