Home
last modified time | relevance | path

Searched refs:kCpEpsilon (Results 1 – 4 of 4) sorted by relevance

/dports/math/py-or-tools/or-tools-9.2/ortools/sat/
H A Dlinear_programming_constraint.cc387 static_cast<int64_t>(std::ceil(info.lp_objective - kCpEpsilon))); in SolveLpForBranching()
596 if (value < lb - kCpEpsilon || value > ub + kCpEpsilon) return Propagate(); in IncrementalPropagate()
1426 100.0 * kCpEpsilon)); in Propagate()
1544 std::ceil(relaxed_optimal_objective - kCpEpsilon))); in Propagate()
1573 std::ceil(relaxed_optimal_objective - kCpEpsilon))); in Propagate()
1606 kCpEpsilon) { in Propagate()
2236 const double new_ub = std::floor(cp_other_bound + kCpEpsilon); in ReducedCostStrengtheningDeductions()
2246 const double new_lb = std::ceil(cp_other_bound - kCpEpsilon); in ReducedCostStrengtheningDeductions()
2792 if (std::abs(rc) < kCpEpsilon) continue; in UpdateAverageReducedCosts()
2866 std::ceil(this->GetSolutionValue(var) - kCpEpsilon)); in LPReducedCostAverageDecision()
[all …]
H A Dfeasibility_pump.h147 static const double kCpEpsilon; variable
H A Dfeasibility_pump.cc36 const double FeasibilityPump::kCpEpsilon = 1e-4; member in operations_research::sat::FeasibilityPump
401 lp_solution_is_integer_ = lp_solution_fractionality_ < kCpEpsilon; in SolveLp()
H A Dlinear_programming_constraint.h393 static constexpr double kCpEpsilon = 1e-4; variable