scientific article

zbMath0481.90063MaRDI QIDQ3939599

Martin Grötschel, Achim Bachem

Publication date: 1982

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

zbMATH Keywords

surveyhomogenizationpolarizationpolynomial algorithmvalid inequalitieslatticeslinear algebraverticesfacetspolyhedral theoryellipsoid methodfaces of polyhedraFourier-Motzkin elimination algorithmminimal representations of polyhedra

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Integer programming (90C10) Inequalities and extremum problems involving convexity in convex geometry (52A40) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Enumerative combinatorics (05A99) Polytopes and polyhedra (52Bxx)

Related Items

On box totally dual integral polyhedra, Facets of the \(k\)-partition polytope, The equipartition polytope. I: Formulations, dimension and basic facets, The max-cut problem on graphs not contractible to \(K_ 5\), On N. Z. Shor's three scientific ideas, Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs, Polyhedral results for a vehicle routing problem, A spectral method for concordant polyhedral faces, An analytical comparison of different formulations of the travelling salesman problem, A cutting plane algorithm for the windy postman problem, A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds, Structure of a simple scheduling polyhedron, Large-scale 0-1 linear programming on distributed workstations, A spectral approach to polyhedral dimension, Unique representation in convex sets by extraction of marked components, Recent trends in combinatorial optimization, Canonical equation sets for classes of concordant polytopes, Unnamed Item