The reformulation-optimization software engine
ICMS'10 Proceedings of the Third international congress conference on Mathematical software
Solving large Steiner Triple Covering Problems
Operations Research Letters
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Using symmetry to optimize over the sherali-adams relaxation
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Discrete Applied Mathematics
Improving communication latency with the write-only architecture
Journal of Parallel and Distributed Computing
Parallel partitioning for distributed systems using sequential assignment
Journal of Parallel and Distributed Computing
Valid constraints for the Point Packing in a Square problem
Discrete Applied Mathematics
| Hi-index | 0.00 |
If a mathematical program has many symmetric optima, solving it via Branch-and-Bound techniques often yields search trees of disproportionate sizes; thus, finding and exploiting symmetries is an important task. We propose a method for automatically finding the formulation group of any given Mixed-Integer Nonlinear Program, and for reformulating the problem by means of static symmetry breaking constraints. The reformulated problem—which is likely to have fewer symmetric optima—can then be solved via standard Branch-and-Bound codes such as CPLEX (for linear programs) and Couenne (for nonlinear programs). Our computational results include formulation group tables for the MIPLib3, MIPLib2003, GlobalLib and MINLPLib instance libraries and solution tables for some instances in the aforementioned libraries.