On the existence of optimal solutions to integer and mixed-integer programming problems
From MaRDI portal
Publication:4044365
DOI10.1007/BF01585518zbMath0292.90036OpenAlexW2082154838MaRDI QIDQ4044365
Publication date: 1974
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01585518
Related Items
Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs, Representability in mixed integer programming. I: Characterization results, Unnamed Item, Closedness of Integer Hulls of Simple Conic Sets, On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming, On the facets of mixed integer programs with two integer variables and two constraints, Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies, A closed-form representation of mixed-integer program value functions, The Gap Function: Evaluating Integer Programming Models over Multiple Right-Hand Sides, The structure of the infinite models in integer programming, Integer packing sets form a well-quasi-ordering, Some properties of convex hulls of integer points contained in general convex sets, On disks of the triangular grid: an application of optimization theory in discrete geometry, When the Gomory-chvátal closure coincides with the integer hull, Lattice closures of polyhedra, On the relative strength of split, triangle and quadrilateral cuts, Generating valid linear inequalities for nonlinear programs via sums of squares, The b-hull of an integer program, A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts, A characterization of minimal valid inequalities for mixed integer programs, Relaxations of mixed integer sets from lattice-free polyhedra, Approximation of Corner Polyhedra with Families of Intersection Cuts, Generalized Chvátal-Gomory closures for integer programs with bounds on variables, Irreducible infeasible sets in convex mixed-integer programs, Classical cuts for mixed-integer programming and branch-and-cut, Exact augmented Lagrangian duality for mixed integer linear programming, Certificates of optimality for mixed integer linear programming using generalized subadditive generator functions, Integer programming as projection, Extended formulations in combinatorial optimization, A solution method for a knapsack problem and its variant, Relaxations of mixed integer sets from lattice-free polyhedra, Modeling disjunctive constraints with a logarithmic number of binary variables and constraints, Extended formulations in combinatorial optimization, On convergence in mixed integer programming, Strong duality for a special class of integer programs, Integer programming formulation of combinatorial optimization problems, Two-stage robust mixed integer programming problem with objective uncertainty, The value function of a mixed integer program: I, On approximation algorithms for concave mixed-integer quadratic programming, On quantile cuts and their closure for chance constrained optimization problems, The strength of multi-row aggregation cuts for sign-pattern integer programs, Mixed Integer Linear Programming Formulation Techniques, Cutting-plane theory: Algebraic methods, The value function of a mixed integer program. II, A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations, Two mixed integer programming formulations arising in manufacturing management, Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting, On the complexity of surrogate and group relaxation for integer linear programs, Integer programming duality: Price functions and sensitivity analysis, Cut-Generating Functions for Integer Variables, On Subadditive Duality for Conic Mixed-integer Programs, Representability of functions, Exact Augmented Lagrangian Duality for Mixed Integer Quadratic Programming, On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs, The value function of an integer program, Constructive characterizations of the value-function of a mixed-integer program. I, Constructive characterizations of the value function of a mixed-integer program. II, On abstract duality in mathematical programming, Stochastic Lipschitz dynamic programming, On a generalization of the Chvátal-Gomory closure
Cites Work
