On the existence of optimal solutions to integer and mixed-integer programming problems

Cites work

Comments on Integer Hulls of Two Linear Constraints
Convex Analysis
Group-Theoretic Results in Mixed Integer Programming
scientific article; zbMATH DE number 3177183 (Why is no real title available?)
scientific article; zbMATH DE number 3315310 (Why is no real title available?)
On the Unlimited Number of Faces in Integer Hulls of Linear Programs with a Single Constraint

Cited in

(64)

Constructive characterizations of the value function of a mixed-integer program. II
Representability in mixed integer programming. I: Characterization results
The b-hull of an integer program
A characterization of minimal valid inequalities for mixed integer programs
Strong duality for a special class of integer programs
Integer programming formulation of combinatorial optimization problems
The value function of a mixed integer program: I
Cutting-plane theory: Algebraic methods
The value function of a mixed integer program. II
Two mixed integer programming formulations arising in manufacturing management
Certificates of optimality for mixed integer linear programming using generalized subadditive generator functions
Integer programming as projection
On approximation algorithms for concave mixed-integer quadratic programming
On quantile cuts and their closure for chance constrained optimization problems
Representability of functions
A closed-form representation of mixed-integer program value functions
On the complexity of surrogate and group relaxation for integer linear programs
Stochastic Lipschitz dynamic programming
On a generalization of the Chvátal-Gomory closure
On disks of the triangular grid: an application of optimization theory in discrete geometry
Lattice closures of polyhedra
Generating valid linear inequalities for nonlinear programs via sums of squares
Generalized Chvátal-Gomory closures for integer programs with bounds on variables
The strength of multi-row aggregation cuts for sign-pattern integer programs
Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting
On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs
On the facets of mixed integer programs with two integer variables and two constraints
When the Gomory-chvátal closure coincides with the integer hull
Integer packing sets form a well-quasi-ordering
Mixed integer linear programming formulation techniques
Cut-generating functions for integer variables
Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs
A solution method for a knapsack problem and its variant
On approximation algorithms for concave mixed-integer quadratic programming
Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies
Closedness of integer hulls of simple conic sets
Some properties of convex hulls of integer points contained in general convex sets
Integer programming duality: Price functions and sensitivity analysis
The value function of an integer program
On abstract duality in mathematical programming
scientific article; zbMATH DE number 3557522 (Why is no real title available?)
A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts
Approximation of corner polyhedra with families of intersection cuts
Irreducible infeasible sets in convex mixed-integer programs
Exact augmented Lagrangian duality for mixed integer linear programming
The gap function: evaluating integer programming models over multiple right-hand sides
A notion of total dual integrality for convex, semidefinite, and extended formulations
On Subadditive Duality for Conic Mixed-integer Programs
Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
Exact augmented Lagrangian duality for mixed integer quadratic programming
Relaxations of mixed integer sets from lattice-free polyhedra
Classical cuts for mixed-integer programming and branch-and-cut
Extended formulations in combinatorial optimization
Extended formulations in combinatorial optimization
Relaxations of mixed integer sets from lattice-free polyhedra
On the relative strength of split, triangle and quadrilateral cuts
Implied integrality in mixed-integer optimization
On the strength of Lagrangian duality in multiobjective integer programming
Reducing the Chvátal rank through binarization
On convergence in mixed integer programming
Geoffrion's theorem beyond finiteness and rationality
Two-stage robust mixed integer programming problem with objective uncertainty
Title not available (Why is no real title available?)
Constructive characterizations of the value-function of a mixed-integer program. I

This page was built for publication: On the existence of optimal solutions to integer and mixed-integer programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4044365)