Packing, partitioning, and covering symresacks

DOI10.1016/J.DAM.2020.03.002zbMATH Open1446.90110OpenAlexW3010958872MaRDI QIDQ2192122FDOQ2192122

Authors: Christopher Hojny 

Publication date: 29 June 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.03.002

Recommendations

• Symmetries in binary programs. A polyhedral perspective
• Polytopes associated with symmetry handling
• Packing and partitioning orbitopes
• Exploiting orbits in symmetric ILP
• Pruning by isomorphism in branch-and-cut

zbMATH Keywords

symmetryinteger programmingbranch-and-cutcomplete linear descriptiontotal dual integrality

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10)

Cites Work

• Title not available (Why is that?)
• Practical graph isomorphism. II.
• Computing convex hulls and counting integer points with \texttt{polymake}
• Geometric algorithms and combinatorial optimization
• The complexity of cover inequality separation
• Canonical Cuts on the Unit Hypercube
• Disjunctive programming: Properties of the convex hull of feasible points
• A polyhedral investigation of star colorings
• Efficient computation of sparse hessians using coloring and automatic differentiation
• Branch-cut-and-propagate for the maximum \(k\)-colorable subgraph problem with symmetry
• New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
• Title not available (Why is that?)
• The maximum \(k\)-colorable subgraph problem and orbitopes
• Packing and partitioning orbitopes
• Extended formulations in combinatorial optimization
• Symmetry in integer linear programming
• Orbitopal fixing
• Reformulations in mathematical programming: automatic symmetry detection and exploitation
• Pruning by isomorphism in branch-and-cut
• Exploiting orbits in symmetric ILP
• Fundamental Domains for Integer Programs with Symmetries
• Polyhedral Characterization of Discrete Dynamic Programming
• Branched polyhedral systems
• The complexity of symmetry-breaking formulas
• Polytopes associated with symmetry handling
• Describing orbitopes by linear inequalities and projection based tools.
• Dynamic symmetry-breaking for Boolean satisfiability

Cited In (1)

• Polytopes associated with symmetry handling

Uses Software

• nauty
• SCIP
• MIPLIB
• ColPack
• Traces
• bliss

This page was built for publication: Packing, partitioning, and covering symresacks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2192122)