Interface SymmetryProtoOrBuilder

All Superinterfaces:
com.google.protobuf.MessageLiteOrBuilder, com.google.protobuf.MessageOrBuilder
All Known Implementing Classes:
SymmetryProto, SymmetryProto.Builder
@Generated public interface SymmetryProtoOrBuilder extends com.google.protobuf.MessageOrBuilder

  • Method Details

    • getPermutationsList

      List<SparsePermutationProto> 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;

    • getPermutations

      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;

    • 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;

    • getPermutationsOrBuilderList

      List<? extends SparsePermutationProtoOrBuilder> 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;

    • getPermutationsOrBuilder

      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;

    • getOrbitopesList

      List<DenseMatrixProto> 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;

    • getOrbitopes

      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;

    • 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;

    • getOrbitopesOrBuilderList

      List<? extends DenseMatrixProtoOrBuilder> 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;

    • getOrbitopesOrBuilder

      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;