A General backtrack algorithm for the isomorphism problem of combinatorial objects
Journal of Symbolic Computation
Isomorph-free exhaustive generation
Journal of Algorithms
Combinatorial algorithms: generation, enumeration, and search
ACM SIGACT News
Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
On the Value of Binary Expansions for General Mixed-Integer Linear Programs
Operations Research
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Automatic Generation of Symmetry-Breaking Constraints
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints
INFORMS Journal on Computing
Extended Formulations for Packing and Partitioning Orbitopes
Mathematics of Operations Research
Branch-cut-and-propagate for the maximum k-colorable subgraph problem with symmetry
CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
The maximum k-colorable subgraph problem and orbitopes
Discrete Optimization
| Hi-index | 0.00 |
This paper presents techniques for handling symmetries in integer linear programs where variables can take integer values, extending previous work dealing exclusively with binary variables. Orthogonal array construction and coloring problems are used as illustrations.