Keep the best min outgoing/incoming flow out of a subset.
More...
Keep the best min outgoing/incoming flow out of a subset.
Definition at line 364 of file routing_cuts.h.
#include <routing_cuts.h>
◆ BestBoundHelper() [1/2]
operations_research::sat::BestBoundHelper::BestBoundHelper |
( |
| ) |
|
|
default |
◆ BestBoundHelper() [2/2]
operations_research::sat::BestBoundHelper::BestBoundHelper |
( |
std::string | base_name | ) |
|
|
inlineexplicit |
◆ bound()
int operations_research::sat::BestBoundHelper::bound |
( |
| ) |
const |
|
inline |
◆ CannotBeFirst()
absl::Span< const int > operations_research::sat::BestBoundHelper::CannotBeFirst |
( |
| ) |
const |
|
inline |
◆ CannotBeLast()
absl::Span< const int > operations_research::sat::BestBoundHelper::CannotBeLast |
( |
| ) |
const |
|
inline |
To serve the current subset with bound() num vehicles, one cannot exit the subset with nodes in CannotBeLast() and one cannot enter the subset with node in CannotBeFirst(). Moreover, one cannot enter from or leave to nodes in OutsideNodeThatCannotBeConnected().
Definition at line 394 of file routing_cuts.h.
◆ name()
std::string operations_research::sat::BestBoundHelper::name |
( |
| ) |
const |
|
inline |
◆ Update()
void operations_research::sat::BestBoundHelper::Update |
( |
int | new_bound, |
|
|
std::string | name, |
|
|
absl::Span< const int > | cannot_be_first = {}, |
|
|
absl::Span< const int > | cannot_be_last = {} ) |
|
inline |
The documentation for this class was generated from the following file: