Branched polyhedral systems
From MaRDI portal
Publication:3569817
DOI10.1007/978-3-642-13036-6_14zbMATH Open1285.90082OpenAlexW1781882688MaRDI QIDQ3569817FDOQ3569817
Authors: Volker Kaibel, Andreas Loos 
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
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Cited In (17)
- Branched Willmore spheres
- Title not available (Why is that?)
- Separation routine and extended formulations for the stable set problem in claw-free graphs
- Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem
- Strong IP formulations need large coefficients
- Polytopes associated with symmetry handling
- Constructing extended formulations from reflection relations
- Modified orbital branching for structured symmetry with an application to unit commitment
- Extended formulations in combinatorial optimization
- Column generation for extended formulations
- Mixed integer linear programming formulation techniques
- Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs
- Extension complexity, MSO logic, and treewidth
- Packing, partitioning, and covering symresacks
- Symmetry-breaking inequalities for ILP with structured sub-symmetry
- Matrices with lexicographically-ordered rows
- The role of rationality in integer-programming relaxations
This page was built for publication: Branched polyhedral systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569817)
