Publication date
June 2011
DOI Publisher
Coordinamento SIBA - Università del Salento Language
EnglishAbstract
Every finite (permutation) group is the full symmetry group of a suitable linear program
Every finite (permutation) group is the full symmetry group of a suitable linear program
Groups naturally occu as the symmetries of an object. This is why they appear in so many different a...
An automorphism of finite graph G is a permutation on its vertex set that conserves adjacency. The s...
AbstractLetFbe a finite field. We apply a result of Thierry Berger (1996,Designs Codes Cryptography,...
Every finite (permutation) group is the full symmetry group of a suitable linear program
Erworben im Rahmen der Schweizer Nationallizenzen (http://www.nationallizenzen.ch)This paper deals w...
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...
There is always a natural embedding of $S_{s}\wr S_{k}$ into the linear programming (LP) relaxation ...
AbstractThe n-dimensional Sierpiński gasket X, spanned by n+1 vertices, has (n+1)! symmetries acting...
Excerpt: For a given linear program (LP) a permutation of its variables that sends feasible points t...
As an analogue of linear group representations, where groups act on vector spaces by linear transfor...
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...
Integer optimization is in the class of NP-hard problems, and it is very time and memory intensive t...
Symmetry has long been recognized as a major obstacle in integer programming. Unless properly recogn...
Groups naturally occu as the symmetries of an object. This is why they appear in so many different a...
An automorphism of finite graph G is a permutation on its vertex set that conserves adjacency. The s...
AbstractLetFbe a finite field. We apply a result of Thierry Berger (1996,Designs Codes Cryptography,...
Every finite (permutation) group is the full symmetry group of a suitable linear program
Erworben im Rahmen der Schweizer Nationallizenzen (http://www.nationallizenzen.ch)This paper deals w...
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...
There is always a natural embedding of $S_{s}\wr S_{k}$ into the linear programming (LP) relaxation ...
AbstractThe n-dimensional Sierpiński gasket X, spanned by n+1 vertices, has (n+1)! symmetries acting...
Excerpt: For a given linear program (LP) a permutation of its variables that sends feasible points t...
As an analogue of linear group representations, where groups act on vector spaces by linear transfor...
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...
Integer optimization is in the class of NP-hard problems, and it is very time and memory intensive t...
Symmetry has long been recognized as a major obstacle in integer programming. Unless properly recogn...
Groups naturally occu as the symmetries of an object. This is why they appear in so many different a...
An automorphism of finite graph G is a permutation on its vertex set that conserves adjacency. The s...
AbstractLetFbe a finite field. We apply a result of Thierry Berger (1996,Designs Codes Cryptography,...
Add to ORKG