Package com.google.ortools.sat
package com.google.ortools.sat

ClassDescriptionA specialized linear expression: a * x + bAll affine expressions must take different values.All affine expressions must take different values.Specialized automaton constraint.This constraint forces a sequence of variables to be accepted by an automaton.This constraint forces a sequence of variables to be accepted by an automaton.Argument of the constraints of the form OP(literals).Argument of the constraints of the form OP(literals).Stores an assignment of variables as a list of true literals using their signed representation.Stores an assignment of variables as a list of true literals using their signed representation.An Boolean variable.Specialized circuit constraint.The circuit constraint is defined on a graph where the arc presence are controlled by literals.The circuit constraint is defined on a graph where the arc presence are controlled by literals.A specialized constant linear expression.Wrapper around a ConstraintProto.Next id: 31Next id: 31Main modeling class.Exception thrown when parallel arrays have mismatched lengths.Exception thrown when an array has a wrong length.A constraint programming problem.A constraint programming problem.Optimization objective.Optimization objective.Wrapper around the SAT solver.The response returned by a solver trying to solve a CpModelProto.The response returned by a solver trying to solve a CpModelProto.Just a message used to store dense solution.Just a message used to store dense solution.Parent class to create a callback called at each solution.The status returned by a solver trying to solve a CpModelProto.Specialized cumulative constraint.The sum of the demands of the intervals at each interval point cannot exceed a capacity.The sum of the demands of the intervals at each interval point cannot exceed a capacity.Define the strategy to follow when the solver needs to take a new decision.Advanced usage.Advanced usage.Define the strategy to follow when the solver needs to take a new decision.Once a variable has been chosen, this enum describe what decision is taken on its domain.The order in which the variables above should be considered.A dense matrix of numbers encoded in a flat way, row by row.A dense matrix of numbers encoded in a flat way, row by row.A linear expression interface that can be parsed.The constraint target = vars[index].The constraint target = vars[index].A linear floating point objective: sum coeffs[i] * vars[i] + offset.A linear floating point objective: sum coeffs[i] * vars[i] + offset.An integer variable.An integer variable.This is not really a constraint.This is not really a constraint.An interval variable.An integer variable.The two arrays of variable each represent a function, the second is the inverse of the first: f_direct[i] == j <=> f_inverse[j] == i.The two arrays of variable each represent a function, the second is the inverse of the first: f_direct[i] == j <=> f_inverse[j] == i.A object that can build a LinearExpr object.Protobuf type
operations_research.sat.LinearArgumentProto
Protobuf typeoperations_research.sat.LinearArgumentProto
A linear Boolean constraint which is a bounded sum of linear terms.A linear Boolean constraint which is a bounded sum of linear terms.A linear Boolean problem.A linear Boolean problem.The linear sum vars[i] * coeffs[i] must fall in the given domain.The linear sum vars[i] * coeffs[i] must fall in the given domain.A linear expression (sum (ai * xi) + b).Builder class for the LinearExpr container.Some constraints supports linear expression instead of just using a reference to a variable.Some constraints supports linear expression instead of just using a reference to a variable.The objective of an optimization problem.The objective of an optimization problem.A list of variables, without any semantics.A list of variables, without any semantics.Interface to describe a boolean variable or its negation.Specialized multiple circuit constraint.Specialized NoOverlap2D constraint.The boxes defined by [start_x, end_x) * [start_y, end_y) cannot overlap.The boxes defined by [start_x, end_x) * [start_y, end_y) cannot overlap.All the intervals (index of IntervalConstraintProto) must be disjoint.All the intervals (index of IntervalConstraintProto) must be disjoint.The negation of a boolean variable.This message encodes a partial (or full) assignment of the variables of a CpModelProto.This message encodes a partial (or full) assignment of the variables of a CpModelProto.Specialized reservoir constraint.Maintain a reservoir level within bounds.Maintain a reservoir level within bounds.The "VRP" (Vehicle Routing Problem) constraint.The "VRP" (Vehicle Routing Problem) constraint.Contains the definitions for all the sat algorithm parameters and their default values.Whether to expoit the binary clause to minimize learned clauses further.Contains the definitions for all the sat algorithm parameters and their default values.The clauses that will be kept during a cleanup are the ones that come first under this order.Each time a clause activity is bumped, the clause has a chance to be protected during the next cleanup phase.Do we try to minimize conflicts (greedily) when creating them.Rounding method to use for feasibility pump.In what order do we add the assumptions in a corebased maxsat algorithmWhat stratification algorithm we use in the presence of weight.Specifies the initial polarity (true/false) when the solver branches on a variable.Restart algorithms.The search branching will be used to decide how to branch on unfixed nodes.Variables without activity (i.e.A permutation of integers encoded as a list of cycles, hence the "sparse" format.A permutation of integers encoded as a list of cycles, hence the "sparse" format.EXPERIMENTAL.EXPERIMENTAL.Specialized assignment constraint.The values of the ntuple formed by the given variables can only be one of the listed ntuples in values.The values of the ntuple formed by the given variables can only be one of the listed ntuples in values.A specialized linear expression: sum(ai * xi) + b.