scientific article
From MaRDI portal
Publication:3224030
zbMath1235.90001MaRDI QIDQ3224030
Publication date: 12 March 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (8)
Knapsack polytopes: a survey ⋮ Lexicographical order in integer programming ⋮ Matrices with lexicographically-ordered rows ⋮ Polytopes associated with symmetry handling ⋮ Packing, partitioning, and covering symresacks ⋮ Symmetry-breaking inequalities for ILP with structured sub-symmetry ⋮ Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem ⋮ Strong IP formulations need large coefficients
This page was built for publication:
