Go to the source code of this file.
|
| operations_research |
| The vehicle routing library lets one model and solve generic vehicle routing problems ranging from the Traveling Salesman Problem to more complex problems such as the Capacitated Vehicle Routing Problem with Time Windows.
|
|
| operations_research::sat |
|
|
| DEFINE_INT_TYPE (Coefficient, int64) |
|
const Coefficient | kCoefficientMax (std::numeric_limits< Coefficient::ValueType >::max()) |
|
std::ostream & | operator<< (std::ostream &os, LiteralWithCoeff term) |
|
bool | ComputeBooleanLinearExpressionCanonicalForm (std::vector< LiteralWithCoeff > *cst, Coefficient *bound_shift, Coefficient *max_value) |
|
bool | ApplyLiteralMapping (const absl::StrongVector< LiteralIndex, LiteralIndex > &mapping, std::vector< LiteralWithCoeff > *cst, Coefficient *bound_shift, Coefficient *max_value) |
|
Coefficient | ComputeCanonicalRhs (Coefficient upper_bound, Coefficient bound_shift, Coefficient max_value) |
|
Coefficient | ComputeNegatedCanonicalRhs (Coefficient lower_bound, Coefficient bound_shift, Coefficient max_value) |
|
bool | BooleanLinearExpressionIsCanonical (const std::vector< LiteralWithCoeff > &cst) |
|
void | SimplifyCanonicalBooleanLinearConstraint (std::vector< LiteralWithCoeff > *cst, Coefficient *rhs) |
|