Results 71 to 80 of about 2,347,375 (169)
An Ant Colony based Hyper-Heuristic Approach for the Set Covering Problem
Advances in Distributed Computing and Artificial Intelligence Journal, 2015 The Set Covering Problem (SCP) is a NP-hard combinatorial optimization problem that is challenging for meta-heuristic algorithms. In the optimization literature, several approaches using meta-heuristics have been developed to tackle the SCP and the ...
Alexandre Silvestre FERREIRA +2 more
doaj +1 more source
A tree search approach for the solution of set problems using alternative relaxations [PDF]
, 1988 A number of alternative relaxations for the family of set problems (FSP) in general and set covering problems (SCP) in particular are introduced and discussed.
El-Darzi, E, Mitra, G
core
, 2002 Summary: We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the data and to allow a trade-off between accuracy and complexity. The result is a general-purpose learning machine, suitable for practical learning tasks, that we call ...
Marchand, Mario, Shawe-Taylor, J.
openaire +2 more sources
Exploiting fitness distance correlation of set covering problems [PDF]
The set covering problem is an NP-hard combinatorial optimization problem that arises in applications ranging from crew scheduling in airlines to driver scheduling in public mass transport.
Helena Ramalhinho-Lourenço +2 more
core
Binary Secretary Bird Optimization Algorithm for the Set Covering Problem
MathematicsThe Set Coverage Problem (SCP) is an important combinatorial optimization problem known to be NP-complete. The use of metaheuristics to solve the SCP includes different algorithms.
Broderick Crawford +7 more
doaj +1 more source
Attribute Reduction Based on Consistent Covering Rough Set and Its Application
Complexity, 2017 As an important processing step for rough set theory, attribute reduction aims at eliminating data redundancy and drawing useful information. Covering rough set, as a generalization of classical rough set theory, has attracted wide attention on both ...
Jianchuan Bai +3 more
doaj +1 more source
Optimal location of water level sensors for monitoring mine water inrush based on the set covering model. [PDF]
Sci Rep, 2021 Wu Q, Du Z, Zhao Y, Xu H, Zhang X.
europepmc +1 more source
A set-covering formulation for a drayage problem with single and double container loads
Journal of Industrial Engineering International, 2018 This paper addresses a drayage problem, which is motivated by the case study of a real carrier. Its trucks carry one or two containers from a port to importers and from exporters to the port.
A. Ghezelsoflu +3 more
doaj +1 more source
Utilizing Heuristics and Metaheuristics for Solving the Set Covering Problem
U.Porto Journal of EngineeringA basic combinatorial optimization problem, the Set Covering Problem (SCP) finds extensive use in computer science, operations research, and logistics, among other domains.
Lourenço Sousa de Pinho
doaj +1 more source
A Variable Precision Covering-Based Rough Set Model Based on Functions
The Scientific World Journal, 2014 Classical rough set theory is a technique of granular computing for handling the uncertainty, vagueness, and granularity in information systems. Covering-based rough sets are proposed to generalize this theory for dealing with covering data.
Yanqing Zhu, William Zhu
doaj +1 more source