Google OR-Tools v9.14
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
operations_research::sat::BestBinaryRelationBounds Class Reference

#include <integer_base.h>

Public Member Functions

bool Add (LinearExpression2 expr, IntegerValue lb, IntegerValue ub)
RelationStatus GetStatus (LinearExpression2 expr, IntegerValue lb, IntegerValue ub) const
 Returns the known status of expr <= bound.
IntegerValue GetUpperBound (LinearExpression2 expr) const

Detailed Description

Definition at line 436 of file integer_base.h.

Member Function Documentation

◆ Add()

bool operations_research::sat::BestBinaryRelationBounds::Add ( LinearExpression2 expr,
IntegerValue lb,
IntegerValue ub )

Register the fact that expr \in [lb, ub] is true.

Returns true if this fact is new, that is if the bounds are tighter than the current ones.

Definition at line 113 of file integer_base.cc.

◆ GetStatus()

RelationStatus operations_research::sat::BestBinaryRelationBounds::GetStatus ( LinearExpression2 expr,
IntegerValue lb,
IntegerValue ub ) const

Returns the known status of expr <= bound.

Definition at line 134 of file integer_base.cc.

◆ GetUpperBound()

IntegerValue operations_research::sat::BestBinaryRelationBounds::GetUpperBound ( LinearExpression2 expr) const

Return a valid upper-bound on the given LinearExpression2. Note that we assume kMaxIntegerValue is always valid and returns it if we don't have an entry in the hash-map.

Definition at line 151 of file integer_base.cc.


The documentation for this class was generated from the following files: