Some continuous functions related to corner polyhedra, II

From MaRDI portal
Revision as of 04:25, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5668246

DOI10.1007/BF01585008zbMath0254.90036OpenAlexW4236743999MaRDI QIDQ5668246

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/bf01585008




Related Items (75)

Intersection cuts for single row corner relaxationsSubadditive approaches in integer programmingA concise characterization of strong knapsack facetsOn the extreme inequalities of infinite group problemsOrigin and early evolution of corner polyhedraTwo row mixed-integer cuts via liftingExtended formulations for Gomory corner polyhedraTheoretical challenges towards cutting-plane selectionGeneralized mixed integer rounding inequalities: Facets for infinite group polyhedraMixed-integer cuts from cyclic groupsThe structure of the infinite models in integer programmingPartial hyperplane activation for generalized intersection cutsCoordination of manufacturing and engineering activities during product transitionsNew computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problemA few strong knapsack facetsLifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free TrianglesLifting 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 problemOptimal Cutting Planes from the Group RelaxationsSome continuous functions related to corner polyhedraOn the Practical Strength of Two-Row Tableau Cuts\(n\)-step mingling inequalities: new facets for the mixed-integer knapsack setThe b-hull of an integer programOn \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow setsComposite lifting of group inequalities and an application to two-row mixing inequalitiesA counterexample to a conjecture of Gomory and JohnsonCyclic group blocking polyhedraA 3-slope theorem for the infinite relaxation in the planeAn algorithm for the separation of two-row cutsApproximation of Minimal Functions by Extreme FunctionsA note on the split rank of intersection cutsA characterization of minimal valid inequalities for mixed integer programsOn a generalization of the master cyclic group polyhedronBinary group facets with complete support and non-binary coefficientsCan 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 caseOn the strength of Gomory mixed-integer cuts as group cutsHow tight is the corner relaxation?Certificates of optimality for mixed integer linear programming using generalized subadditive generator functionsThe worst case analysis of strong knapsack facetsSome computationally relevant group theoretic structures of fixed charge problemsEquivariant 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 functionsRelations between facets of low- and high-dimensional group problemsMy experiences as a student and researcher in OR during the 1960's and 70'sValid inequalities based on the interpolation procedureUnnamed ItemFacets, weak facets, and extreme functions of the Gomory-Johnson infinite group problemTwo dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedraAn electronic compendium of extreme functions for the Gomory-Johnson infinite group problemGenerating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functionsThe value function of a mixed integer program: IPiecewise smooth extreme functions are piecewise linearAn extreme function which is nonnegative and discontinuous everywhereExtreme functions with an arbitrary number of slopesMinimal cut-generating functions are nearly extremeMinimal inequalities for mixed integer programsOn Minimal Valid Inequalities for Mixed Integer Conic ProgramsCutting-plane theory: Algebraic methodsValid inequalities for mips and group polyhedra from approximate liftingsSoftware for Cut-Generating Functions in the Gomory–Johnson Model and BeyondIFORS' Operational Research Hall of FameDual-feasible functions for integer programming and combinatorial optimization: algorithms, characterizations, and approximationsCut-Generating Functions for Integer VariablesToward Computer-Assisted Discovery and Automated Proofs of Cutting Plane TheoremsEquivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional CaseThe aggregation closure is polyhedral for packing and covering integer programsEquivariant perturbation in Gomory and Johnson's infinite group problem. VII: Inverse semigroup theory, closures, decomposition of perturbationsConstructive characterizations of the value-function of a mixed-integer program. IValid inequalities based on simple mixed-integer setsConstructive characterizations of the value function of a mixed-integer program. IIA geometric approach to cut-generating functionsFinite Solution Theory for Coalitional GamesStrengthening Chvátal-Gomory cuts and Gomory fractional cutsLight on the infinite group relaxation. I: Foundations and taxonomy




Cites Work




This page was built for publication: Some continuous functions related to corner polyhedra, II