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

DOI10.1016/0166-218X(85)90045-9zbMath0573.90072OpenAlexW1989227958MaRDI QIDQ1062914

C. E. Blair, Robert G. Jeroslow

Publication date: 1985

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(85)90045-9

zbMATH Keywords

Gomory functionspre-multiplied mixed integer constraint set

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items

Representability in mixed integer programming. I: Characterization results, Parametric methods in integer linear programming, Lattice-free simplices with lattice width \(2d - o(d)\), The Gap Function: Evaluating Integer Programming Models over Multiple Right-Hand Sides, Enumeration and unimodular equivalence of empty delta-modular simplices, Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function, Chvátal closures for mixed integer programming problems, Optimality certificates for convex minimization and Helly numbers, Constructive characterizations of the value-function of a mixed-integer program. I

Cites Work

• Unnamed Item
• Unnamed Item
• Constructive characterizations of the value-function of a mixed-integer program. I
• Partitioning procedures for solving mixed-variables programming problems
• The value function of a mixed integer program. II
• 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
• The value function of an integer program
• An Exact Penalty Method for Mixed-Integer Programs
• On the existence of optimal solutions to integer and mixed-integer programming problems
• Convex Analysis
• Some continuous functions related to corner polyhedra, II