Branched Polyhedral Systems
From MaRDI portal
Publication:3569817
DOI10.1007/978-3-642-13036-6_14zbMath1285.90082OpenAlexW1781882688MaRDI QIDQ3569817
Publication date: 22 June 2010
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13036-6_14
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items (16)
Matrices with lexicographically-ordered rows ⋮ Polytopes associated with symmetry handling ⋮ Packing, partitioning, and covering symresacks ⋮ The role of rationality in integer-programming relaxations ⋮ Symmetry-breaking inequalities for ILP with structured sub-symmetry ⋮ Unnamed Item ⋮ Column generation for extended formulations ⋮ Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem ⋮ Constructing Extended Formulations from Reflection Relations ⋮ Extended formulations in combinatorial optimization ⋮ Strong IP formulations need large coefficients ⋮ Unnamed Item ⋮ Separation routine and extended formulations for the stable set problem in claw-free graphs ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ Modified orbital branching for structured symmetry with an application to unit commitment ⋮ Unnamed Item
This page was built for publication: Branched Polyhedral Systems
