Java Reference

SymmetryProtoOrBuilder

Detailed Description

Definition at line 6 of file SymmetryProtoOrBuilder.java.

Public Member Functions

int getPermutationsCount ()

int getOrbitopesCount ()

◆ getOrbitopes()

 com.google.ortools.sat.DenseMatrixProto getOrbitopes ( int index )
```An orbitope is a special symmetry structure of the solution space. If the
variable indices are arranged in a matrix (with no duplicates), then any
permutation of the columns will be a valid permutation of the feasible
space.
This arise quite often. The typical example is a graph coloring problem
where for each node i, you have j booleans to indicate its color. If the
variables color_of_i_is_j are arranged in a matrix[i][j], then any columns
permutations leave the problem invariant.
```

`repeated .operations_research.sat.DenseMatrixProto orbitopes = 2;`

Implemented in SymmetryProto.Builder, and SymmetryProto.

◆ getOrbitopesCount()

 int getOrbitopesCount ( )
```An orbitope is a special symmetry structure of the solution space. If the
variable indices are arranged in a matrix (with no duplicates), then any
permutation of the columns will be a valid permutation of the feasible
space.
This arise quite often. The typical example is a graph coloring problem
where for each node i, you have j booleans to indicate its color. If the
variables color_of_i_is_j are arranged in a matrix[i][j], then any columns
permutations leave the problem invariant.
```

`repeated .operations_research.sat.DenseMatrixProto orbitopes = 2;`

Implemented in SymmetryProto.Builder, and SymmetryProto.

◆ getOrbitopesList()

 java.util.List getOrbitopesList ( )
```An orbitope is a special symmetry structure of the solution space. If the
variable indices are arranged in a matrix (with no duplicates), then any
permutation of the columns will be a valid permutation of the feasible
space.
This arise quite often. The typical example is a graph coloring problem
where for each node i, you have j booleans to indicate its color. If the
variables color_of_i_is_j are arranged in a matrix[i][j], then any columns
permutations leave the problem invariant.
```

`repeated .operations_research.sat.DenseMatrixProto orbitopes = 2;`

Implemented in SymmetryProto.Builder, and SymmetryProto.

◆ getOrbitopesOrBuilder()

 com.google.ortools.sat.DenseMatrixProtoOrBuilder getOrbitopesOrBuilder ( int index )
```An orbitope is a special symmetry structure of the solution space. If the
variable indices are arranged in a matrix (with no duplicates), then any
permutation of the columns will be a valid permutation of the feasible
space.
This arise quite often. The typical example is a graph coloring problem
where for each node i, you have j booleans to indicate its color. If the
variables color_of_i_is_j are arranged in a matrix[i][j], then any columns
permutations leave the problem invariant.
```

`repeated .operations_research.sat.DenseMatrixProto orbitopes = 2;`

Implemented in SymmetryProto.Builder, and SymmetryProto.

◆ getOrbitopesOrBuilderList()

 java.util.List getOrbitopesOrBuilderList ( )
```An orbitope is a special symmetry structure of the solution space. If the
variable indices are arranged in a matrix (with no duplicates), then any
permutation of the columns will be a valid permutation of the feasible
space.
This arise quite often. The typical example is a graph coloring problem
where for each node i, you have j booleans to indicate its color. If the
variables color_of_i_is_j are arranged in a matrix[i][j], then any columns
permutations leave the problem invariant.
```

`repeated .operations_research.sat.DenseMatrixProto orbitopes = 2;`

Implemented in SymmetryProto.Builder, and SymmetryProto.

◆ getPermutations()

 com.google.ortools.sat.SparsePermutationProto getPermutations ( int index )
```A list of variable indices permutations that leave the feasible space of
solution invariant. Usually, we only encode a set of generators of the
group.
```

`repeated .operations_research.sat.SparsePermutationProto permutations = 1;`

Implemented in SymmetryProto.Builder, and SymmetryProto.

◆ getPermutationsCount()

 int getPermutationsCount ( )
```A list of variable indices permutations that leave the feasible space of
solution invariant. Usually, we only encode a set of generators of the
group.
```

`repeated .operations_research.sat.SparsePermutationProto permutations = 1;`

Implemented in SymmetryProto.Builder, and SymmetryProto.

◆ getPermutationsList()

 java.util.List getPermutationsList ( )
```A list of variable indices permutations that leave the feasible space of
solution invariant. Usually, we only encode a set of generators of the
group.
```

`repeated .operations_research.sat.SparsePermutationProto permutations = 1;`

Implemented in SymmetryProto.Builder, and SymmetryProto.

◆ getPermutationsOrBuilder()

 com.google.ortools.sat.SparsePermutationProtoOrBuilder getPermutationsOrBuilder ( int index )
```A list of variable indices permutations that leave the feasible space of
solution invariant. Usually, we only encode a set of generators of the
group.
```

`repeated .operations_research.sat.SparsePermutationProto permutations = 1;`

Implemented in SymmetryProto.Builder, and SymmetryProto.

◆ getPermutationsOrBuilderList()

 java.util.List getPermutationsOrBuilderList ( )
```A list of variable indices permutations that leave the feasible space of
solution invariant. Usually, we only encode a set of generators of the
group.
```

`repeated .operations_research.sat.SparsePermutationProto permutations = 1;`

Implemented in SymmetryProto.Builder, and SymmetryProto.

The documentation for this interface was generated from the following file: