set_cover_heuristics.h File Reference

#include <cstdint>
#include <limits>
#include <string>
#include <vector>
#include "absl/strings/string_view.h"
#include "absl/time/time.h"
#include "absl/types/span.h"
#include "ortools/algorithms/adjustable_k_ary_heap.h"
#include "ortools/set_cover/base_types.h"
#include "ortools/set_cover/set_cover_invariant.h"
#include "ortools/set_cover/set_cover_model.h"

Go to the source code of this file.

Classes
class	operations_research::SetCoverSolutionGenerator
class	operations_research::SubsetListBasedSolutionGenerator
class	operations_research::BoolVectorBasedSolutionGenerator
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::LazySteepestSearch
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.