Some continuous functions related to corner polyhedra
From MaRDI portal
Publication:5659338
DOI10.1007/BF01584976zbMath0246.90029OpenAlexW1965681691MaRDI QIDQ5659338
Ralph E. Gomory, Ellis L. Johnson
Publication date: 1972
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01584976
Related Items
Coordination of manufacturing and engineering activities during product transitions, Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts, Intersection cuts for nonlinear integer programming: convexification techniques for structured sets, Convex hull of two quadratic or a conic quadratic and a quadratic inequality, Intersection cuts for single row corner relaxations, Maximal Quadratic-Free Sets, Subadditive approaches in integer programming, A concise characterization of strong knapsack facets, On sublinear inequalities for mixed integer conic programs, On the extreme inequalities of infinite group problems, Origin and early evolution of corner polyhedra, Two row mixed-integer cuts via lifting, Mixed-integer sets from two rows of two adjacent simplex bases, Extended formulations for Gomory corner polyhedra, Theoretical challenges towards cutting-plane selection, Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra, On the facets of mixed integer programs with two integer variables and two constraints, General purpose heuristics for integer programming. I, Mixed-integer cuts from cyclic groups, The structure of the infinite models in integer programming, Partial hyperplane activation for generalized intersection cuts, Unique lifting of integer variables in minimal inequalities, Structure and interpretation of dual-feasible functions, New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem, A few strong knapsack facets, Computing with Multi-row Gomory Cuts, Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles, Lifting properties of maximal lattice-free polyhedra, \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem, Optimal Cutting Planes from the Group Relaxations, Outer-product-free sets for polynomial optimization and oracle-based cuts, Generalized intersection cuts and a new cut generating paradigm, \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set, The master equality polyhedron with multiple rows, On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets, Enumerative inequalities in integer programming, Composite lifting of group inequalities and an application to two-row mixing inequalities, A counterexample to a conjecture of Gomory and Johnson, Some continuous functions related to corner polyhedra, II, A 3-slope theorem for the infinite relaxation in the plane, Computational experience with a group theoretic integer programming algorithm, An algorithm for the separation of two-row cuts, Approximation of Minimal Functions by Extreme Functions, On a generalization of the master cyclic group polyhedron, Improved integer programming bounds using intersections of corner polyhedra, Binary group facets with complete support and non-binary coefficients, Can Cut-Generating Functions Be Good and Efficient?, Equivariant perturbation in Gomory and Johnson's infinite group problem (V). Software for the continuous and discontinuous 1-row case, Sufficiency of cut-generating functions, On the strength of Gomory mixed-integer cuts as group cuts, How tight is the corner relaxation?, The worst case analysis of strong knapsack facets, Some cut-generating functions for second-order conic sets, Some computationally relevant group theoretic structures of fixed charge problems, Equivariant perturbation in Gomory and Johnson's infinite group problem. III: Foundations for the \(k\)-dimensional case with applications to \(k=2\), Equivariant perturbation in Gomory and Johnson's infinite group problem. VI: The curious case of two-sided discontinuous minimal valid functions, Relations between facets of low- and high-dimensional group problems, My experiences as a student and researcher in OR during the 1960's and 70's, Non-standard approaches to integer programming, Computing with multi-row gomory cuts, On the exact separation of mixed integer knapsack cuts, Valid inequalities based on the interpolation procedure, Unnamed Item, Polyhedral annexation in mixed integer and combinatorial programming, Facets, weak facets, and extreme functions of the Gomory-Johnson infinite group problem, Constructing general dual-feasible functions, An electronic compendium of extreme functions for the Gomory-Johnson infinite group problem, Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions, The (not so) trivial lifting in two dimensions, Valid inequalities for mixed integer linear programs, Minimal inequalities, Piecewise smooth extreme functions are piecewise linear, An extreme function which is nonnegative and discontinuous everywhere, On degenerate multi-row Gomory cuts, The strength of multi-row models, On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints, On the implementation and strengthening of intersection cuts for QCQPs, Lifting convex inequalities for bipartite bilinear programs, Extreme functions with an arbitrary number of slopes, Minimal cut-generating functions are nearly extreme, On Minimal Valid Inequalities for Mixed Integer Conic Programs, On the implementation and strengthening of intersection cuts for QCQPs, Lifting convex inequalities for bipartite bilinear programs, Valid inequalities for mips and group polyhedra from approximate liftings, Characterization of facets for multiple right-hand choice linear programs, Software for Cut-Generating Functions in the Gomory–Johnson Model and Beyond, IFORS' Operational Research Hall of Fame, Dual-feasible functions for integer programming and combinatorial optimization: algorithms, characterizations, and approximations, Integer programming duality: Price functions and sensitivity analysis, Cut-Generating Functions for Integer Variables, Toward Computer-Assisted Discovery and Automated Proofs of Cutting Plane Theorems, Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case, Polytopes of partitions of numbers, The aggregation closure is polyhedral for packing and covering integer programs, Cut-Generating Functions and S-Free Sets, Equivariant perturbation in Gomory and Johnson's infinite group problem. VII: Inverse semigroup theory, closures, decomposition of perturbations, The value function of an integer program, Valid inequalities based on simple mixed-integer sets, A geometric approach to cut-generating functions, Mappings and Facets for Nonabelian Group Problems, Maximal quadratic-free sets, Strengthening Chvátal-Gomory cuts and Gomory fractional cuts, Light on the infinite group relaxation. I: Foundations and taxonomy
Cites Work
