| CheckInvariantConsistency() const | operations_research::SetCoverSolutionGenerator | |
| class_name() const | operations_research::SetCoverSolutionGenerator | inline |
| ComputeGap(const SubsetCostVector &reduced_costs, const SubsetBoolVector &solution, const ElementCostVector &multipliers) const | operations_research::SetCoverLagrangian | |
| ComputeLagrangianValue(const SubsetCostVector &reduced_costs, const ElementCostVector &multipliers) const | operations_research::SetCoverLagrangian | |
| ComputeLowerBound(const SubsetCostVector &costs, Cost upper_bound) | operations_research::SetCoverLagrangian | |
| ComputeReducedCosts(const SubsetCostVector &costs, const ElementCostVector &multipliers) const | operations_research::SetCoverLagrangian | |
| ComputeSubgradient(const SubsetCostVector &reduced_costs) const | operations_research::SetCoverLagrangian | |
| consistency_level_ | operations_research::SetCoverSolutionGenerator | protected |
| cost() const | operations_research::SetCoverSolutionGenerator | inline |
| InitializeLagrangeMultipliers() const | operations_research::SetCoverLagrangian | |
| inv() const | operations_research::SetCoverSolutionGenerator | inline |
| max_iterations() const | operations_research::SetCoverSolutionGenerator | inline |
| model() const | operations_research::SetCoverSolutionGenerator | inlineprotected |
| name() const | operations_research::SetCoverSolutionGenerator | inline |
| NextSolution(absl::Span< const SubsetIndex > _) final | operations_research::SetCoverLagrangian | inlinevirtual |
| NextSolution() final | operations_research::SetCoverLagrangian | inlinevirtual |
| NextSolution(const SubsetBoolVector &in_focus) final | operations_research::SetCoverLagrangian | inlinevirtual |
| num_subsets() const | operations_research::SetCoverSolutionGenerator | inlineprotected |
| ParallelComputeLagrangianValue(const SubsetCostVector &reduced_costs, const ElementCostVector &multipliers) const | operations_research::SetCoverLagrangian | |
| ParallelComputeReducedCosts(const SubsetCostVector &costs, const ElementCostVector &multipliers) const | operations_research::SetCoverLagrangian | |
| ParallelComputeSubgradient(const SubsetCostVector &reduced_costs) const | operations_research::SetCoverLagrangian | |
| ParallelUpdateMultipliers(double step_size, Cost lagrangian_value, Cost upper_bound, const SubsetCostVector &reduced_costs, ElementCostVector *multipliers) const | operations_research::SetCoverLagrangian | |
| ResetLimits() | operations_research::SetCoverSolutionGenerator | inlinevirtual |
| run_time() const | operations_research::SetCoverSolutionGenerator | inline |
| run_time_ | operations_research::SetCoverSolutionGenerator | protected |
| run_time_in_microseconds() const | operations_research::SetCoverSolutionGenerator | inline |
| run_time_in_seconds() const | operations_research::SetCoverSolutionGenerator | inline |
| SetCoverLagrangian(SetCoverInvariant *inv) | operations_research::SetCoverLagrangian | inlineexplicit |
| SetCoverLagrangian(SetCoverInvariant *inv, const absl::string_view name) | operations_research::SetCoverLagrangian | inline |
| SetCoverSolutionGenerator(SetCoverInvariant *inv, SetCoverInvariant::ConsistencyLevel consistency_level, absl::string_view class_name, absl::string_view name) | operations_research::SetCoverSolutionGenerator | inline |
| SetMaxIterations(int64_t max_iterations) | operations_research::SetCoverSolutionGenerator | inline |
| SetName(const absl::string_view name) | operations_research::SetCoverSolutionGenerator | inline |
| SetTimeLimitInSeconds(double seconds) | operations_research::SetCoverSolutionGenerator | inline |
| SubsetListBasedSolutionGenerator(SetCoverInvariant *inv, SetCoverInvariant::ConsistencyLevel consistency_level, absl::string_view class_name, absl::string_view name) | operations_research::SubsetListBasedSolutionGenerator | inlineexplicit |
| ThreePhase(Cost upper_bound) | operations_research::SetCoverLagrangian | |
| time_limit_in_seconds() const | operations_research::SetCoverSolutionGenerator | inlineprotected |
| UpdateMultipliers(double step_size, Cost lagrangian_value, Cost upper_bound, const SubsetCostVector &reduced_costs, ElementCostVector *multipliers) const | operations_research::SetCoverLagrangian | |
| UseNumThreads(int num_threads) | operations_research::SetCoverLagrangian | inline |
| ~SetCoverSolutionGenerator()=default | operations_research::SetCoverSolutionGenerator | virtual |