Add to ORKGThe problem of classifying all isomorphism classes of OA(N, k, s, t)s is shown to be equivalent to finding all isomorphism classes of non-negative integer solutions to a system of linear equations under the symmetry group of the system of equations. A branch-and-cut algorithm developed by Margot (2002, 2003a, 2003b, 2005) for solving integer programming problems with large symmetry groups is used to fin
In this survey we address three of the principle algebraic approaches to integer programming. After ...
AbstractThis paper presents techniques for handling symmetries in integer linear programs where vari...
Erworben im Rahmen der Schweizer Nationallizenzen (http://www.nationallizenzen.ch)This paper deals w...
The problem of classifying all isomorphism classes of OA(N, k, s, t)s is shown to be equivalent to f...
The problem of classifying all isomorphism classes of OA(N,k,s,t)'s is shown to be equivalent to fin...
Excerpt: For a given linear program (LP) a permutation of its variables that sends feasible points t...
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...
Abstract. This paper describes components of a branch-and-cut algorithm for solving in-teger linear ...
This paper deals with exploiting symmetry for solving linear and integer programming problems. Basic...
Integer linear programs arise in many situations, and solving such problems can be computationally d...
This paper describes components of a branch-and-cut algorithm for solving integer linear programs ha...
Erworben im Rahmen der Schweizer Nationallizenzen (http://www.nationallizenzen.ch)This paper deals w...
The N-Queens problem is commonly used to teach the programming technique of backtrack search. The N-...
In this survey we address three of the principle algebraic approaches to integer programming. After ...
AbstractThis paper presents techniques for handling symmetries in integer linear programs where vari...
Erworben im Rahmen der Schweizer Nationallizenzen (http://www.nationallizenzen.ch)This paper deals w...
The problem of classifying all isomorphism classes of OA(N, k, s, t)s is shown to be equivalent to f...
The problem of classifying all isomorphism classes of OA(N,k,s,t)'s is shown to be equivalent to fin...
Excerpt: For a given linear program (LP) a permutation of its variables that sends feasible points t...
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...
Abstract. This paper describes components of a branch-and-cut algorithm for solving in-teger linear ...
This paper deals with exploiting symmetry for solving linear and integer programming problems. Basic...
Integer linear programs arise in many situations, and solving such problems can be computationally d...
This paper describes components of a branch-and-cut algorithm for solving integer linear programs ha...
Erworben im Rahmen der Schweizer Nationallizenzen (http://www.nationallizenzen.ch)This paper deals w...
The N-Queens problem is commonly used to teach the programming technique of backtrack search. The N-...
In this survey we address three of the principle algebraic approaches to integer programming. After ...
AbstractThis paper presents techniques for handling symmetries in integer linear programs where vari...
Erworben im Rahmen der Schweizer Nationallizenzen (http://www.nationallizenzen.ch)This paper deals w...