Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
#include "ortools/algorithms/set_cover_heuristics.h"
#include <algorithm>
#include <cstddef>
#include <limits>
#include <numeric>
#include <utility>
#include <vector>
#include "absl/log/check.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. | |
Functions | |
constexpr SubsetIndex | operations_research::kNotFound (-1) |
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. | |
Variables | |
static constexpr Cost | operations_research::kMaxPossibleCost = std::numeric_limits<Cost>::max() |
static constexpr double | operations_research::kInfinity = std::numeric_limits<float>::infinity() |