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. © 2006 Elsevier Ltd. All rights reserved.
Margot, F. (2007). Symmetric ILP: Coloring and small integers. Discrete Optimization, 4(1), 40–62. https://doi.org/10.1016/j.disopt.2006.10.008