Orbital shrinking

DOI10.1007/978-3-642-32147-4_6MaRDI QIDQ3167611zbMATH OpenOpenAlexFDO

Authors Matteo Fischetti, Leo Liberti

Publication date 2 November 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32147-4_6

zbMATH Keywords

algebraconvex MINLPdiscrete optimizationmathematical programmingMILPrelaxationsymmetry

Mathematics Subject Classification ID

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

Recommendations

• Orbital branching
• Orbital Branching
• Orbital shrinking: theory and applications
• Orbital Shrinking: A New Tool for Hybrid MIP/CP Methods
• Orbital independence in symmetric mathematical programs

Cited in

(15)

• An implicit model for multi-activity shift scheduling problems
• A computational comparison of symmetry handling methods for mixed integer programs
• Orbital shrinking: theory and applications
• Polytopes associated with symmetry handling
• On solving a hard quadratic 3-dimensional assignment problem
• Orbital independence in symmetric mathematical programs
• Equivalence of lattice orbit polytopes
• Using symmetry to optimize over the Sherali-Adams relaxation
• Orbital Branching
• Orbital branching
• Handling sub-symmetry in integer programming using activation handlers
• A unified framework for symmetry handling
• Symmetry detection in mixed-integer conic programming
• Reformulations of separable quadratic optimization problems with symmetric structures via variable aggregation
• Exploiting symmetries in mathematical programming via orbital independence

This page was built for publication: Orbital shrinking

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