set_cover_heuristics.h File Reference

#include <cstddef>
#include <vector>
#include "absl/base/nullability.h"
#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::SubsetIndexWithPriority
	Priority aggregate for the subset priority queue. More...
class	operations_research::Preprocessor
class	operations_research::TrivialSolutionGenerator
class	operations_research::RandomSolutionGenerator
class	operations_research::GreedySolutionGenerator
class	operations_research::ElementDegreeSolutionGenerator
class	operations_research::SteepestSearch
class	operations_research::TabuList< T >
class	operations_research::GuidedTabuSearch
class	operations_research::GuidedLocalSearch

Namespaces
namespace	operations_research
	In SWIG mode, we don't want anything besides these top-level includes.

Functions
std::vector< SubsetIndex >	operations_research::ClearRandomSubsets (std::size_t num_subsets, SetCoverInvariant *inv)
std::vector< SubsetIndex >	operations_research::ClearRandomSubsets (absl::Span< const SubsetIndex > focus, std::size_t num_subsets, SetCoverInvariant *inv)
	Same as above, but clears the subset indices in focus.
std::vector< SubsetIndex >	operations_research::ClearMostCoveredElements (std::size_t max_num_subsets, SetCoverInvariant *inv)
std::vector< SubsetIndex >	operations_research::ClearMostCoveredElements (absl::Span< const SubsetIndex > focus, std::size_t num_subsets, SetCoverInvariant *inv)
	Same as above, but clears the subset indices in focus.