Go to the source code of this file.
|
| 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.
|
|
| operations_research::sat |
|
|
void | MinimizeCoreWithPropagation (SatSolver *solver, std::vector< Literal > *core) |
|
SatSolver::Status | SolveWithFuMalik (LogBehavior log, const LinearBooleanProblem &problem, SatSolver *solver, std::vector< bool > *solution) |
|
SatSolver::Status | SolveWithWPM1 (LogBehavior log, const LinearBooleanProblem &problem, SatSolver *solver, std::vector< bool > *solution) |
|
SatSolver::Status | SolveWithRandomParameters (LogBehavior log, const LinearBooleanProblem &problem, int num_times, SatSolver *solver, std::vector< bool > *solution) |
|
SatSolver::Status | SolveWithLinearScan (LogBehavior log, const LinearBooleanProblem &problem, SatSolver *solver, std::vector< bool > *solution) |
|
SatSolver::Status | SolveWithCardinalityEncoding (LogBehavior log, const LinearBooleanProblem &problem, SatSolver *solver, std::vector< bool > *solution) |
|
SatSolver::Status | SolveWithCardinalityEncodingAndCore (LogBehavior log, const LinearBooleanProblem &problem, SatSolver *solver, std::vector< bool > *solution) |
|
SatSolver::Status | MinimizeIntegerVariableWithLinearScanAndLazyEncoding (IntegerVariable objective_var, const std::function< void()> &feasible_solution_observer, Model *model) |
|
void | RestrictObjectiveDomainWithBinarySearch (IntegerVariable objective_var, const std::function< void()> &feasible_solution_observer, Model *model) |
|
SatSolver::Status | MinimizeWithHittingSetAndLazyEncoding (const ObjectiveDefinition &objective_definition, const std::function< void()> &feasible_solution_observer, Model *model) |
|