![]() |
OR-Tools
8.0
|
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. | |
| operations_research::sat | |
Functions | |
| std::vector< double > | ScaleContinuousVariables (double scaling, double max_bound, MPModelProto *mp_model) |
| int | FindRationalFactor (double x, int limit, double tolerance) |
| std::vector< double > | DetectImpliedIntegers (bool log_info, MPModelProto *mp_model) |
| bool | ConvertMPModelProtoToCpModelProto (const SatParameters ¶ms, const MPModelProto &mp_model, CpModelProto *cp_model) |
| bool | ConvertBinaryMPModelProtoToBooleanProblem (const MPModelProto &mp_model, LinearBooleanProblem *problem) |
| void | ConvertBooleanProblemToLinearProgram (const LinearBooleanProblem &problem, glop::LinearProgram *lp) |
| int | FixVariablesFromSat (const SatSolver &solver, glop::LinearProgram *lp) |
| bool | SolveLpAndUseSolutionForSatAssignmentPreference (const glop::LinearProgram &lp, SatSolver *sat_solver, double max_time_in_seconds) |
| bool | SolveLpAndUseIntegerVariableToStartLNS (const glop::LinearProgram &lp, LinearBooleanProblem *problem) |
| std::vector<double> coefficients |
Definition at line 442 of file sat/lp_utils.cc.
| std::vector<double> lower_bounds |
Definition at line 443 of file sat/lp_utils.cc.
| double max_relative_coeff_error = 0.0 |
Definition at line 435 of file sat/lp_utils.cc.
| double max_scaling_factor = 0.0 |
Definition at line 437 of file sat/lp_utils.cc.
| double max_sum_error = 0.0 |
Definition at line 436 of file sat/lp_utils.cc.
Definition at line 440 of file sat/lp_utils.cc.
| std::vector<double> upper_bounds |
Definition at line 444 of file sat/lp_utils.cc.
| std::vector<int> var_indices |
Definition at line 441 of file sat/lp_utils.cc.
| double wanted_precision = 1e-6 |
Definition at line 439 of file sat/lp_utils.cc.