examples/cpp/sat_runner.cc
double GetScaledTrivialBestBound(const LinearBooleanProblem& problem) {
  Coefficient best_bound(0);
  const LinearObjective& objective = problem.objective();
  for (const int64 value : objective.coefficients()) {
    if (value < 0) best_bound += Coefficient(value);
  }
  return AddOffsetAndScaleObjectiveValue(problem, best_bound);
}
// Returns a trivial best bound. The best bound corresponds to the lower bound
// (resp. upper bound) in case of a minimization (resp. maximization) problem.
Returns a trivial best bound. The best bound corresponds to the lower bound
(resp. upper bound) in case of a minimization (resp. maximization) problem.
Returns a trivial best bound . The best bound corresponds to the lower bound ( resp . upper bound ) in case of a minimization ( resp . maximization ) problem .
double GetScaledTrivialBestBound(const LinearBooleanProblem& problem) {
  Coefficient best_bound(0);
  const LinearObjective& objective = problem.objective();
  for (const int64 value : objective.coefficients()) {
    if (value < 0) best_bound += Coefficient(value);
  }
  return AddOffsetAndScaleObjectiveValue(problem, best_bound);
}
double GetScaledTrivialBestBound ( const LinearBooleanProblem & problem ) { Coefficient best_bound ( 0 ) ; const LinearObjective & objective = problem . objective ( ) ; for ( const int64 value : objective . coefficients ( ) ) { if ( value < 0 ) best_bound += Coefficient ( value ) ; } return AddOffsetAndScaleObjectiveValue ( problem , best_bound ) ; }
Returns a trivial best bound.
Returns a trivial best bound .