Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
#include <algorithm>
#include <functional>
#include <memory>
#include <vector>
#include "absl/types/span.h"
#include "ortools/base/macros.h"
#include "ortools/sat/integer.h"
#include "ortools/sat/intervals.h"
#include "ortools/sat/model.h"
#include "ortools/sat/precedences.h"
#include "ortools/sat/sat_base.h"
#include "ortools/sat/theta_tree.h"
#include "ortools/util/strong_integers.h"
Go to the source code of this file.
Classes | |
class | operations_research::sat::TaskSet |
struct | operations_research::sat::TaskSet::Entry |
struct | operations_research::sat::PropagationStatistics |
Simple class to display statistics at the end if –v=1. More... | |
class | operations_research::sat::DisjunctiveOverloadChecker |
class | operations_research::sat::DisjunctiveSimplePrecedences |
class | operations_research::sat::DisjunctiveDetectablePrecedences |
class | operations_research::sat::AllIntervalsHelper |
class | operations_research::sat::CombinedDisjunctive< time_direction > |
class | operations_research::sat::DisjunctiveNotLast |
class | operations_research::sat::DisjunctiveEdgeFinding |
class | operations_research::sat::DisjunctivePrecedences |
class | operations_research::sat::DisjunctiveWithTwoItems |
Namespaces | |
namespace | operations_research |
In SWIG mode, we don't want anything besides these top-level includes. | |
namespace | operations_research::sat |
Functions | |
void | operations_research::sat::AddDisjunctive (const std::vector< IntervalVariable > &intervals, Model *model) |
void | operations_research::sat::AddDisjunctiveWithBooleanPrecedencesOnly (const std::vector< IntervalVariable > &intervals, Model *model) |