![]() |
OR-Tools
8.2
|
Go to the source code of this file.
Namespaces | |
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. | |
Functions | |
bool | IntervalsAreSortedAndNonAdjacent (absl::Span< const ClosedInterval > intervals) |
Returns true iff we have: More... | |
int64 | CeilRatio (int64 value, int64 positive_coeff) |
int64 | FloorRatio (int64 value, int64 positive_coeff) |
std::ostream & | operator<< (std::ostream &out, const ClosedInterval &interval) |
std::ostream & | operator<< (std::ostream &out, const std::vector< ClosedInterval > &intervals) |
std::ostream & | operator<< (std::ostream &out, const Domain &domain) |
int64 | SumOfKMinValueInDomain (const Domain &domain, int k) |
int64 | SumOfKMaxValueInDomain (const Domain &domain, int k) |