AbstractThis 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
One available technique to solve certain classes of problems (particularly those of a combi-natorial...
Integer linear programs arise in many situations, and solving such problems can be computationally d...
The problem of classifying all isomorphism classes of OA(N, k, s, t)s is shown to be equivalent to f...
AbstractThis paper presents techniques for handling symmetries in integer linear programs where vari...
An integer linear program (ILP) is symmetric if its variables can be permuted without changing the s...
An integer linear program (ILP) is symmetric if its variables can be permuted without changing the s...
This paper deals with exploiting symmetry for solving linear and integer programming problems. Basic...
Erworben im Rahmen der Schweizer Nationallizenzen (http://www.nationallizenzen.ch)This paper deals w...
Erworben im Rahmen der Schweizer Nationallizenzen (http://www.nationallizenzen.ch)This paper deals w...
Excerpt: For a given linear program (LP) a permutation of its variables that sends feasible points t...
Symmetry has long been recognized as a major obstacle in integer programming. Unless properly recogn...
This thesis explores two algorithmic approaches for exploiting symmetries in linear and integer line...
Integer optimization is in the class of NP-hard problems, and it is very time and memory intensive t...
The problem of classifying all isomorphism classes of OA(N,k,s,t)'s is shown to be equivalent to fin...
This paper describes components of a branch-and-cut algorithm for solving integer linear programs ha...
One available technique to solve certain classes of problems (particularly those of a combi-natorial...
Integer linear programs arise in many situations, and solving such problems can be computationally d...
The problem of classifying all isomorphism classes of OA(N, k, s, t)s is shown to be equivalent to f...
AbstractThis paper presents techniques for handling symmetries in integer linear programs where vari...
An integer linear program (ILP) is symmetric if its variables can be permuted without changing the s...
An integer linear program (ILP) is symmetric if its variables can be permuted without changing the s...
This paper deals with exploiting symmetry for solving linear and integer programming problems. Basic...
Erworben im Rahmen der Schweizer Nationallizenzen (http://www.nationallizenzen.ch)This paper deals w...
Erworben im Rahmen der Schweizer Nationallizenzen (http://www.nationallizenzen.ch)This paper deals w...
Excerpt: For a given linear program (LP) a permutation of its variables that sends feasible points t...
Symmetry has long been recognized as a major obstacle in integer programming. Unless properly recogn...
This thesis explores two algorithmic approaches for exploiting symmetries in linear and integer line...
Integer optimization is in the class of NP-hard problems, and it is very time and memory intensive t...
The problem of classifying all isomorphism classes of OA(N,k,s,t)'s is shown to be equivalent to fin...
This paper describes components of a branch-and-cut algorithm for solving integer linear programs ha...
One available technique to solve certain classes of problems (particularly those of a combi-natorial...
Integer linear programs arise in many situations, and solving such problems can be computationally d...
The problem of classifying all isomorphism classes of OA(N, k, s, t)s is shown to be equivalent to f...
DOI
Add to ORKG