Branched polyhedral systems
From MaRDI portal
Publication:3569817
Recommendations
Cited in
(17)- Branched Willmore spheres
- The role of rationality in integer-programming relaxations
- scientific article; zbMATH DE number 7559421 (Why is no real title available?)
- 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
- Column generation for extended formulations
- Extended formulations in combinatorial optimization
- 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
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)