Orbital branching

DOI10.1007/s10107-009-0273-xzbMath1206.90101MaRDI QIDQ623461

Fabrizio Rossi, Stefano Smriglio, Jeff Linderoth, James Ostrowski

Publication date: 14 February 2011

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-009-0273-x

zbMATH Keywords

symmetry; integer programming; branch-and-bound algorithms

Mathematics Subject Classification ID

90C10: Integer programming

Related Items

Orbitopal fixing, Using symmetry to optimize over the Sherali-Adams relaxation, Stabilizer-based symmetry breaking constraints for mathematical programs, Algorithms for highly symmetric linear and integer programs, Solving large Steiner Triple Covering Problems, Modified orbital branching for structured symmetry with an application to unit commitment, Exploiting symmetry in integer convex optimization using core points, On solving a hard quadratic 3-dimensional assignment problem, Exploiting Symmetries in Polyhedral Computations, Algorithms and Software for Convex Mixed Integer Nonlinear Programs

Uses Software

• nauty
• MINTO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Packing and partitioning orbitopes
• MINTO, a Mixed INTeger Optimizer
• Pruning by isomorphism in branch-and-cut
• Small covering designs by branch-and-cut
• Exploiting orbits in symmetric ILP
• The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts
• Branching rules revisited
• A branch-and-cut algorithm for graph coloring
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Improving Discrete Model Representations via Symmetry Considerations
• Constraint Orbital Branching
• A Computational Study of Search Strategies for Mixed Integer Programming
• Football Pools--A Game for Mathematicians
• Orbitopal Fixing
• Orbital Branching
• Benchmarking optimization software with performance profiles.