![]() |
Google OR-Tools v9.12
a fast and portable software suite for combinatorial optimization
|
#include "ortools/algorithms/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/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/algorithms/set_cover_invariant.h"
#include "ortools/algorithms/set_cover_model.h"
#include "ortools/base/logging.h"
Go to the source code of this file.
Namespaces | |
namespace | operations_research |
In SWIG mode, we don't want anything besides these top-level includes. | |
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) |
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. | |
Variables | |
static constexpr Cost | operations_research::kMaxPossibleCost = std::numeric_limits<Cost>::max() |
static constexpr double | operations_research::kInfinity = std::numeric_limits<float>::infinity() |