ortools.algorithms.python.set_cover

class SetCoverModelStats(pybind11_builtins.pybind11_object):
SetCoverModelStats(*args, **kwargs)
def debug_string(unknown):
class SetCoverModel(pybind11_builtins.pybind11_object):
SetCoverModel()
subset_costs
columns
rows
row_view_is_valid
def SubsetRange(unknown):

SubsetRange(self: ortools.algorithms.python.set_cover.SetCoverModel) -> Iterator[int]

def ElementRange(unknown):

ElementRange(self: ortools.algorithms.python.set_cover.SetCoverModel) -> Iterator[int]

all_subsets
def add_empty_subset(unknown):

add_empty_subset(self: ortools.algorithms.python.set_cover.SetCoverModel, cost: float) -> None

def add_element_to_last_subset(unknown):

add_element_to_last_subset(self: ortools.algorithms.python.set_cover.SetCoverModel, element: int) -> None

def set_subset_cost(unknown):

set_subset_cost(self: ortools.algorithms.python.set_cover.SetCoverModel, subset: int, cost: float) -> None

def add_element_to_subset(unknown):

add_element_to_subset(self: ortools.algorithms.python.set_cover.SetCoverModel, subset: int, cost: int) -> None

def create_sparse_row_view(unknown):

create_sparse_row_view(self: ortools.algorithms.python.set_cover.SetCoverModel) -> None

def sort_elements_in_subsets(unknown):

sort_elements_in_subsets(self: ortools.algorithms.python.set_cover.SetCoverModel) -> None

def compute_feasibility(unknown):

compute_feasibility(self: ortools.algorithms.python.set_cover.SetCoverModel) -> bool

def reserve_num_subsets(unknown):

reserve_num_subsets(self: ortools.algorithms.python.set_cover.SetCoverModel, num_subsets: int) -> None

def reserve_num_elements_in_subset(unknown):

reserve_num_elements_in_subset(self: ortools.algorithms.python.set_cover.SetCoverModel, num_elements: int, subset: int) -> None

def export_model_as_proto(unknown):

export_model_as_proto(self: ortools.algorithms.python.set_cover.SetCoverModel) -> operations_research::SetCoverProto

def import_model_from_proto(unknown):

import_model_from_proto(self: ortools.algorithms.python.set_cover.SetCoverModel, arg0: operations_research::SetCoverProto) -> None

def compute_column_stats(unknown):
def compute_row_deciles(unknown):

compute_row_deciles(self: ortools.algorithms.python.set_cover.SetCoverModel) -> list[int]

def compute_column_deciles(unknown):

compute_column_deciles(self: ortools.algorithms.python.set_cover.SetCoverModel) -> list[int]

class SetCoverDecision(pybind11_builtins.pybind11_object):
SetCoverDecision()

__init__(args, *kwargs) Overloaded function.

  1. __init__(self: ortools.algorithms.python.set_cover.SetCoverDecision) -> None

  2. __init__(self: ortools.algorithms.python.set_cover.SetCoverDecision, subset: int, value: bool) -> None

def subset(unknown):
def decision(unknown):
class consistency_level(pybind11_builtins.pybind11_object):

Members:

COST_AND_COVERAGE

FREE_AND_UNCOVERED

REDUNDANCY

consistency_level()

__init__(self: ortools.algorithms.python.set_cover.consistency_level, value: int) -> None

name

name(self: object) -> str

COST_AND_COVERAGE = <consistency_level.COST_AND_COVERAGE: 1>
FREE_AND_UNCOVERED = <consistency_level.FREE_AND_UNCOVERED: 2>
REDUNDANCY = <consistency_level.REDUNDANCY: 3>
class SetCoverInvariant(pybind11_builtins.pybind11_object):
def initialize(unknown):
def clear(unknown):
def cost(unknown):
def num_uncovered_elements(unknown):

num_uncovered_elements(self: ortools.algorithms.python.set_cover.SetCoverInvariant) -> int

def is_selected(unknown):
def num_free_elements(unknown):

num_free_elements(self: ortools.algorithms.python.set_cover.SetCoverInvariant) -> list[int]

def num_coverage_le_1_elements(unknown):

num_coverage_le_1_elements(self: ortools.algorithms.python.set_cover.SetCoverInvariant) -> list[int]

def coverage(unknown):
def compute_coverage_in_focus(unknown):

compute_coverage_in_focus(self: ortools.algorithms.python.set_cover.SetCoverInvariant, focus: list[int]) -> list[int]

def is_redundant(unknown):
def clear_trace(unknown):
def clear_removability_information(unknown):

clear_removability_information(self: ortools.algorithms.python.set_cover.SetCoverInvariant) -> None

def newly_removable_subsets(unknown):

newly_removable_subsets(self: ortools.algorithms.python.set_cover.SetCoverInvariant) -> list[util_intops::StrongInt]

def newly_non_removable_subsets(unknown):

newly_non_removable_subsets(self: ortools.algorithms.python.set_cover.SetCoverInvariant) -> list[util_intops::StrongInt]

def compress_trace(unknown):
def load_solution(unknown):

load_solution(self: ortools.algorithms.python.set_cover.SetCoverInvariant, arg0: list[bool]) -> None

def check_consistency(unknown):
def compute_is_redundant(unknown):

compute_is_redundant(self: ortools.algorithms.python.set_cover.SetCoverInvariant, subset: int) -> bool

def select(unknown):
def deselect(unknown):
def export_solution_as_proto(unknown):

export_solution_as_proto(self: ortools.algorithms.python.set_cover.SetCoverInvariant) -> operations_research::SetCoverSolutionResponse

def import_solution_from_proto(unknown):

import_solution_from_proto(self: ortools.algorithms.python.set_cover.SetCoverInvariant, arg0: operations_research::SetCoverSolutionResponse) -> None

class TrivialSolutionGenerator(pybind11_builtins.pybind11_object):
def next_solution(unknown):

next_solution(args, *kwargs) Overloaded function.

  1. next_solution(self: ortools.algorithms.python.set_cover.TrivialSolutionGenerator) -> bool

  2. next_solution(self: ortools.algorithms.python.set_cover.TrivialSolutionGenerator, arg0: absl::lts_20240722::Span) -> bool

class RandomSolutionGenerator(pybind11_builtins.pybind11_object):
def next_solution(unknown):

next_solution(args, *kwargs) Overloaded function.

  1. next_solution(self: ortools.algorithms.python.set_cover.RandomSolutionGenerator) -> bool

  2. next_solution(self: ortools.algorithms.python.set_cover.RandomSolutionGenerator, arg0: absl::lts_20240722::Span) -> bool

class GreedySolutionGenerator(pybind11_builtins.pybind11_object):
def next_solution(unknown):

next_solution(args, *kwargs) Overloaded function.

  1. next_solution(self: ortools.algorithms.python.set_cover.GreedySolutionGenerator) -> bool

  2. next_solution(self: ortools.algorithms.python.set_cover.GreedySolutionGenerator, arg0: absl::lts_20240722::Span) -> bool

  3. next_solution(self: ortools.algorithms.python.set_cover.GreedySolutionGenerator, arg0: absl::lts_20240722::Span, arg1: absl::lts_20240722::Span) -> bool

class ElementDegreeSolutionGenerator(pybind11_builtins.pybind11_object):
def next_solution(unknown):

next_solution(args, *kwargs) Overloaded function.

  1. next_solution(self: ortools.algorithms.python.set_cover.ElementDegreeSolutionGenerator) -> bool

  2. next_solution(self: ortools.algorithms.python.set_cover.ElementDegreeSolutionGenerator, arg0: absl::lts_20240722::Span) -> bool

  3. next_solution(self: ortools.algorithms.python.set_cover.ElementDegreeSolutionGenerator, arg0: list[int], arg1: list[float]) -> bool

class LazyElementDegreeSolutionGenerator(pybind11_builtins.pybind11_object):
def next_solution(unknown):

next_solution(args, *kwargs) Overloaded function.

  1. next_solution(self: ortools.algorithms.python.set_cover.LazyElementDegreeSolutionGenerator) -> bool

  2. next_solution(self: ortools.algorithms.python.set_cover.LazyElementDegreeSolutionGenerator, arg0: list[int]) -> bool

  3. next_solution(self: ortools.algorithms.python.set_cover.LazyElementDegreeSolutionGenerator, arg0: absl::lts_20240722::Span, arg1: absl::lts_20240722::Span) -> bool

class SteepestSearch(pybind11_builtins.pybind11_object):
def next_solution(unknown):

next_solution(args, *kwargs) Overloaded function.

  1. next_solution(self: ortools.algorithms.python.set_cover.SteepestSearch, arg0: int) -> bool

  2. next_solution(self: ortools.algorithms.python.set_cover.SteepestSearch, arg0: list[int], arg1: int) -> bool

  3. next_solution(self: ortools.algorithms.python.set_cover.SteepestSearch, arg0: list[int], arg1: list[float], arg2: int) -> bool

class GuidedLocalSearch(pybind11_builtins.pybind11_object):
def initialize(unknown):
def next_solution(unknown):

next_solution(args, *kwargs) Overloaded function.

  1. next_solution(self: ortools.algorithms.python.set_cover.GuidedLocalSearch, arg0: int) -> bool

  2. next_solution(self: ortools.algorithms.python.set_cover.GuidedLocalSearch, arg0: absl::lts_20240722::Span, arg1: int) -> bool

class TabuList(pybind11_builtins.pybind11_object):
TabuList()

__init__(self: ortools.algorithms.python.set_cover.TabuList, size: int) -> None

def size(unknown):
def init(unknown):

init(self: ortools.algorithms.python.set_cover.TabuList, size: int) -> None

def add(unknown):
def contains(unknown):

contains(self: ortools.algorithms.python.set_cover.TabuList, t: int) -> bool

class GuidedTabuSearch(pybind11_builtins.pybind11_object):
def initialize(unknown):
def next_solution(unknown):

next_solution(args, *kwargs) Overloaded function.

  1. next_solution(self: ortools.algorithms.python.set_cover.GuidedTabuSearch, arg0: int) -> bool

  2. next_solution(self: ortools.algorithms.python.set_cover.GuidedTabuSearch, arg0: list[int], arg1: int) -> bool

def get_lagrangian_factor(unknown):

get_lagrangian_factor(self: ortools.algorithms.python.set_cover.GuidedTabuSearch, factor: float) -> None

def set_lagrangian_factor(unknown):

set_lagrangian_factor(self: ortools.algorithms.python.set_cover.GuidedTabuSearch) -> float

def set_epsilon(unknown):

set_epsilon(self: ortools.algorithms.python.set_cover.GuidedTabuSearch, r: float) -> None

def get_epsilon(unknown):
def set_penalty_factor(unknown):

set_penalty_factor(self: ortools.algorithms.python.set_cover.GuidedTabuSearch, factor: float) -> None

def get_penalty_factor(unknown):

get_penalty_factor(self: ortools.algorithms.python.set_cover.GuidedTabuSearch) -> float

def set_tabu_list_size(unknown):

set_tabu_list_size(self: ortools.algorithms.python.set_cover.GuidedTabuSearch, size: int) -> None

def get_tabu_list_size(unknown):
def clear_random_subsets(unknown):

clear_random_subsets(args, *kwargs) Overloaded function.

  1. clear_random_subsets(arg0: int, arg1: ortools.algorithms.python.set_cover.SetCoverInvariant) -> list[int]

  2. clear_random_subsets(arg0: list[int], arg1: int, arg2: ortools.algorithms.python.set_cover.SetCoverInvariant) -> list[int]

def clear_most_covered_elements(unknown):

clear_most_covered_elements(args, *kwargs) Overloaded function.

  1. clear_most_covered_elements(arg0: int, arg1: ortools.algorithms.python.set_cover.SetCoverInvariant) -> list[int]

  2. clear_most_covered_elements(arg0: absl::lts_20240722::Span, arg1: int, arg2: ortools.algorithms.python.set_cover.SetCoverInvariant) -> list[int]

def read_orlib_scp(unknown):
def read_orlib_rail(unknown):
def read_fimi_dat(unknown):
def read_set_cover_proto(unknown):

read_set_cover_proto(arg0: str, arg1: bool) -> ortools.algorithms.python.set_cover.SetCoverModel

def write_orlib_scp(unknown):

write_orlib_scp(arg0: ortools.algorithms.python.set_cover.SetCoverModel, arg1: str) -> None

def write_orlib_rail(unknown):

write_orlib_rail(arg0: ortools.algorithms.python.set_cover.SetCoverModel, arg1: str) -> None

def write_set_cover_proto(unknown):

write_set_cover_proto(arg0: ortools.algorithms.python.set_cover.SetCoverModel, arg1: str, arg2: bool) -> None

def write_set_cover_solution_text(unknown):

write_set_cover_solution_text(arg0: ortools.algorithms.python.set_cover.SetCoverModel, arg1: util_intops::StrongVector, bool, std::allocator >, arg2: str) -> None

def write_set_cover_solution_proto(unknown):

write_set_cover_solution_proto(arg0: ortools.algorithms.python.set_cover.SetCoverModel, arg1: util_intops::StrongVector, bool, std::allocator >, arg2: str, arg3: bool) -> None

def read_set_cover_solution_text(unknown):

read_set_cover_solution_text(arg0: str) -> util_intops::StrongVector, bool, std::allocator >

def read_set_cover_solution_proto(unknown):

read_set_cover_solution_proto(arg0: str, arg1: bool) -> util_intops::StrongVector, bool, std::allocator >