![]() |
Google OR-Tools v9.14
a fast and portable software suite for combinatorial optimization
|
#include "ortools/sat/optimization.h"#include <algorithm>#include <cmath>#include <cstdint>#include <functional>#include <string>#include <utility>#include <vector>#include "absl/cleanup/cleanup.h"#include "absl/container/btree_map.h"#include "absl/container/btree_set.h"#include "absl/container/flat_hash_set.h"#include "absl/log/check.h"#include "absl/log/log.h"#include "absl/log/vlog_is_on.h"#include "absl/strings/str_cat.h"#include "absl/strings/str_format.h"#include "absl/types/span.h"#include "ortools/base/logging.h"#include "ortools/base/stl_util.h"#include "ortools/base/strong_vector.h"#include "ortools/sat/boolean_problem.pb.h"#include "ortools/sat/clause.h"#include "ortools/sat/encoding.h"#include "ortools/sat/integer.h"#include "ortools/sat/integer_base.h"#include "ortools/sat/integer_expr.h"#include "ortools/sat/integer_search.h"#include "ortools/sat/model.h"#include "ortools/sat/pb_constraint.h"#include "ortools/sat/sat_base.h"#include "ortools/sat/sat_parameters.pb.h"#include "ortools/sat/sat_solver.h"#include "ortools/sat/synchronization.h"#include "ortools/sat/util.h"#include "ortools/util/sorted_interval_list.h"#include "ortools/util/strong_integers.h"#include "ortools/util/time_limit.h"Go to the source code of this file.
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::MinimizeCoreWithPropagation (TimeLimit *limit, SatSolver *solver, std::vector< Literal > *core) |
| void | operations_research::sat::MinimizeCoreWithSearch (TimeLimit *limit, SatSolver *solver, std::vector< Literal > *core) |
| bool | operations_research::sat::ProbeLiteral (Literal assumption, SatSolver *solver) |
| void | operations_research::sat::FilterAssignedLiteral (const VariablesAssignment &assignment, std::vector< Literal > *core) |
| A core cannot be all true. | |
| SatSolver::Status | operations_research::sat::MinimizeIntegerVariableWithLinearScanAndLazyEncoding (IntegerVariable objective_var, const std::function< void()> &feasible_solution_observer, Model *model) |
| void | operations_research::sat::RestrictObjectiveDomainWithBinarySearch (IntegerVariable objective_var, const std::function< void()> &feasible_solution_observer, Model *model) |
| void | operations_research::sat::PresolveBooleanLinearExpression (std::vector< Literal > *literals, std::vector< Coefficient > *coefficients, Coefficient *offset) |