Package com.google.ortools.sat

Interface RoutesConstraintProtoOrBuilder

  • All Superinterfaces:
    com.google.protobuf.MessageLiteOrBuilder, com.google.protobuf.MessageOrBuilder
    All Known Implementing Classes:
    RoutesConstraintProto, RoutesConstraintProto.Builder
    public interface RoutesConstraintProtoOrBuilder
extends com.google.protobuf.MessageOrBuilder

    • Method Summary

      All Methods Instance Methods Abstract Methods 
      Modifier and Type Method Description
      long getCapacity()
      int64 capacity = 5;
      int getDemands​(int index)
      EXPERIMENTAL.
      int getDemandsCount()
      EXPERIMENTAL.
      java.util.List<java.lang.Integer> getDemandsList()
      EXPERIMENTAL.
      int getHeads​(int index)
      repeated int32 heads = 2;
      int getHeadsCount()
      repeated int32 heads = 2;
      java.util.List<java.lang.Integer> getHeadsList()
      repeated int32 heads = 2;
      int getLiterals​(int index)
      repeated int32 literals = 3;
      int getLiteralsCount()
      repeated int32 literals = 3;
      java.util.List<java.lang.Integer> getLiteralsList()
      repeated int32 literals = 3;
      int getTails​(int index)
      repeated int32 tails = 1;
      int getTailsCount()
      repeated int32 tails = 1;
      java.util.List<java.lang.Integer> getTailsList()
      repeated int32 tails = 1;

      • Methods inherited from interface com.google.protobuf.MessageLiteOrBuilder

        isInitialized

      • Methods inherited from interface com.google.protobuf.MessageOrBuilder

        findInitializationErrors, getAllFields, getDefaultInstanceForType, getDescriptorForType, getField, getInitializationErrorString, getOneofFieldDescriptor, getRepeatedField, getRepeatedFieldCount, getUnknownFields, hasField, hasOneof

    • Method Detail

      • getTailsList

        java.util.List<java.lang.Integer> getTailsList()
        repeated int32 tails = 1;
        Returns:
        A list containing the tails.

      • getTailsCount

        int getTailsCount()
        repeated int32 tails = 1;
        Returns:
        The count of tails.

      • getTails

        int getTails​(int index)
        repeated int32 tails = 1;
        Parameters:
        index - The index of the element to return.
        Returns:
        The tails at the given index.

      • getHeadsList

        java.util.List<java.lang.Integer> getHeadsList()
        repeated int32 heads = 2;
        Returns:
        A list containing the heads.

      • getHeadsCount

        int getHeadsCount()
        repeated int32 heads = 2;
        Returns:
        The count of heads.

      • getHeads

        int getHeads​(int index)
        repeated int32 heads = 2;
        Parameters:
        index - The index of the element to return.
        Returns:
        The heads at the given index.

      • getLiteralsList

        java.util.List<java.lang.Integer> getLiteralsList()
        repeated int32 literals = 3;
        Returns:
        A list containing the literals.

      • getLiteralsCount

        int getLiteralsCount()
        repeated int32 literals = 3;
        Returns:
        The count of literals.

      • getLiterals

        int getLiterals​(int index)
        repeated int32 literals = 3;
        Parameters:
        index - The index of the element to return.
        Returns:
        The literals at the given index.

      • getDemandsList

        java.util.List<java.lang.Integer> getDemandsList()
         EXPERIMENTAL. The demands for each node, and the maximum capacity for each
 route. Note that this is currently only used for the LP relaxation and one
 need to add the corresponding constraint to enforce this outside of the LP.

 TODO(user): Ideally, we should be able to extract any dimension like these
 (i.e. capacity, route_length, etc..) automatically from the encoding. The
 classical way to encode that is to have "current_capacity" variables along
 the route and linear equations of the form:
   arc_literal => (current_capacity_tail + demand <= current_capacity_head)
        repeated int32 demands = 4;
        Returns:
        A list containing the demands.

      • getDemandsCount

        int getDemandsCount()
         EXPERIMENTAL. The demands for each node, and the maximum capacity for each
 route. Note that this is currently only used for the LP relaxation and one
 need to add the corresponding constraint to enforce this outside of the LP.

 TODO(user): Ideally, we should be able to extract any dimension like these
 (i.e. capacity, route_length, etc..) automatically from the encoding. The
 classical way to encode that is to have "current_capacity" variables along
 the route and linear equations of the form:
   arc_literal => (current_capacity_tail + demand <= current_capacity_head)
        repeated int32 demands = 4;
        Returns:
        The count of demands.

      • getDemands

        int getDemands​(int index)
         EXPERIMENTAL. The demands for each node, and the maximum capacity for each
 route. Note that this is currently only used for the LP relaxation and one
 need to add the corresponding constraint to enforce this outside of the LP.

 TODO(user): Ideally, we should be able to extract any dimension like these
 (i.e. capacity, route_length, etc..) automatically from the encoding. The
 classical way to encode that is to have "current_capacity" variables along
 the route and linear equations of the form:
   arc_literal => (current_capacity_tail + demand <= current_capacity_head)
        repeated int32 demands = 4;
        Parameters:
        index - The index of the element to return.
        Returns:
        The demands at the given index.

      • getCapacity

        long getCapacity()
        int64 capacity = 5;
        Returns:
        The capacity.