Some continuous functions related to corner polyhedra
From MaRDI portal
Publication:5659338
DOI10.1007/BF01584976zbMath0246.90029MaRDI QIDQ5659338
Ellis L. Johnson, Ralph E. Gomory
Publication date: 1972
Published in: Mathematical Programming (Search for Journal in Brave)
90C10: Integer programming
Related Items
On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints, Enumerative inequalities in integer programming, Some continuous functions related to corner polyhedra, II, Computational experience with a group theoretic integer programming algorithm, IFORS' Operational Research Hall of Fame, Non-standard approaches to integer programming, On the extreme inequalities of infinite group problems, Mixed-integer cuts from cyclic groups, On the strength of Gomory mixed-integer cuts as group cuts, How tight is the corner relaxation?, Relations between facets of low- and high-dimensional group problems, Computing with multi-row gomory cuts, Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions, Valid inequalities for mixed integer linear programs, On degenerate multi-row Gomory cuts, Valid inequalities for mips and group polyhedra from approximate liftings, General purpose heuristics for integer programming. I, Strengthening Chvátal-Gomory cuts and Gomory fractional cuts, On a generalization of the master cyclic group polyhedron, Subadditive approaches in integer programming, Extended formulations for Gomory corner polyhedra, Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra, On the facets of mixed integer programs with two integer variables and two constraints, Valid inequalities based on the interpolation procedure, Polytopes of partitions of numbers, Valid inequalities based on simple mixed-integer sets, Two row mixed-integer cuts via lifting, Mixed-integer sets from two rows of two adjacent simplex bases, Computing with Multi-row Gomory Cuts, Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles, Mappings and Facets for Nonabelian Group Problems, Minimal inequalities, Characterization of facets for multiple right-hand choice linear programs, Integer programming duality: Price functions and sensitivity analysis, The value function of an integer program, Improved integer programming bounds using intersections of corner polyhedra, Some computationally relevant group theoretic structures of fixed charge problems, Polyhedral annexation in mixed integer and combinatorial programming
Cites Work
