![]() |
Google OR-Tools v9.12
a fast and portable software suite for combinatorial optimization
|
#include <vector>
#include "absl/types/span.h"
#include "ortools/algorithms/adjustable_k_ary_heap.h"
#include "ortools/algorithms/set_cover_invariant.h"
#include "ortools/algorithms/set_cover_model.h"
Go to the source code of this file.
Classes | |
class | operations_research::TrivialSolutionGenerator |
The consistency level is maintained up to kFreeAndUncovered. More... | |
class | operations_research::RandomSolutionGenerator |
The consistency level is maintained up to kFreeAndUncovered. More... | |
class | operations_research::GreedySolutionGenerator |
The consistency level is maintained up to kFreeAndUncovered. More... | |
class | operations_research::ElementDegreeSolutionGenerator |
The consistency level is maintained up to kFreeAndUncovered. More... | |
class | operations_research::LazyElementDegreeSolutionGenerator |
class | operations_research::SteepestSearch |
The consistency level is maintained up to kFreeAndUncovered. More... | |
class | operations_research::TabuList< T > |
class | operations_research::GuidedTabuSearch |
The consistency level is maintained up to kFreeAndUncovered. More... | |
class | operations_research::GuidedLocalSearch |
The consistency level is maintained up to kRedundancy. More... | |
Namespaces | |
namespace | operations_research |
In SWIG mode, we don't want anything besides these top-level includes. | |
Functions | |
std::vector< SubsetIndex > | operations_research::ClearRandomSubsets (BaseInt num_subsets, SetCoverInvariant *inv) |
The consistency level is maintained up to kCostAndCoverage. | |
std::vector< SubsetIndex > | operations_research::ClearRandomSubsets (absl::Span< const SubsetIndex > focus, BaseInt num_subsets, SetCoverInvariant *inv) |
Same as above, but clears the subset indices in focus. | |
std::vector< SubsetIndex > | operations_research::ClearMostCoveredElements (BaseInt num_subsets, SetCoverInvariant *inv) |
The consistency level is maintained up to kCostAndCoverage. | |
std::vector< SubsetIndex > | operations_research::ClearMostCoveredElements (absl::Span< const SubsetIndex > focus, BaseInt num_subsets, SetCoverInvariant *inv) |
Same as above, but clears the subset indices in focus. | |