![]() |
Google OR-Tools v9.15
a fast and portable software suite for combinatorial optimization
|
#include "ortools/set_cover/set_cover_heuristics.h"#include <algorithm>#include <climits>#include <cstdint>#include <limits>#include <numeric>#include <utility>#include <vector>#include "absl/base/casts.h"#include "absl/log/check.h"#include "absl/log/log.h"#include "absl/numeric/bits.h"#include "absl/random/distributions.h"#include "absl/random/random.h"#include "absl/types/span.h"#include "ortools/algorithms/adjustable_k_ary_heap.h"#include "ortools/base/logging.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.
Namespaces | |
| namespace | operations_research |
| OR-Tools root namespace. | |
| namespace | operations_research::internal |
Typedefs | |
| using | operations_research::CL = SetCoverInvariant::ConsistencyLevel |
Functions | |
| constexpr SubsetIndex | operations_research::kNotFound (-1) |
| std::vector< SubsetIndex > | operations_research::ClearRandomSubsets (BaseInt num_subsets, SetCoverInvariant *inv) |
| std::vector< SubsetIndex > | operations_research::ClearRandomSubsets (absl::Span< const SubsetIndex > focus, BaseInt num_subsets_to_choose, SetCoverInvariant *inv) |
| std::vector< SubsetIndex > | operations_research::ClearMostCoveredElements (BaseInt max_num_subsets, SetCoverInvariant *inv) |
| std::vector< SubsetIndex > | operations_research::ClearMostCoveredElements (absl::Span< const SubsetIndex > focus, BaseInt max_num_subsets, SetCoverInvariant *inv) |
Variables | |
| static constexpr Cost | operations_research::kMaxPossibleCost = std::numeric_limits<Cost>::max() |
| static constexpr double | operations_research::kInfinity = std::numeric_limits<float>::infinity() |