scientific article; zbMATH DE number 3555734

From MaRDI portal
Revision as of 08:53, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4128251

zbMath0356.90038MaRDI QIDQ4128251

Ellis L. Johnson

Publication date: 1974


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (28)

Operations that Preserve the Covering Property of the Lifting RegionOn sublinear inequalities for mixed integer conic programsCharacterization of the split closure via geometric liftingTheoretical challenges towards cutting-plane selectionThe structure of the infinite models in integer programmingUnique lifting of integer variables in minimal inequalitiesEvaluating mixed-integer programming models over multiple right-hand sidesCoordination of manufacturing and engineering activities during product transitionsMonoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cutsLifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free TrianglesLifting properties of maximal lattice-free polyhedraOptimal Cutting Planes from the Group RelaxationsThe b-hull of an integer programComposite lifting of group inequalities and an application to two-row mixing inequalitiesApproximation of Minimal Functions by Extreme FunctionsA characterization of minimal valid inequalities for mixed integer programsCan 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 caseThe value function of a mixed integer program: IExtreme functions with an arbitrary number of slopesMinimal cut-generating functions are nearly extremeMinimal inequalities for mixed integer programsCutting-plane theory: Algebraic methodsThe value function of a mixed integer program. IIThe aggregation closure is polyhedral for packing and covering integer programsA framework for generalized Benders' decomposition and its application to multilevel optimizationA geometric approach to cut-generating functionsLight on the infinite group relaxation. I: Foundations and taxonomy







This page was built for publication: