Results 11 to 20 of about 1,486,783 (327)
Effective Approaches to Solve P-Center Problem via Set Covering and SAT [PDF]
IEEE Access, 2020 The classic p -center problem consists of choosing a set of p vertices in an undirected graph as facilities in order to minimize the maximum distance between each client vertex and its closest facility.
Xiaolu Liu +5 more
openalex +3 more sources
Application of the artificial bee colony algorithm for solving the set covering problem. [PDF]
ScientificWorldJournal, 2014 The set covering problem is a formal model for many practical optimization problems. In the set covering problem the goal is to choose a subset of the columns of minimal cost that covers every row.
Crawford B, Soto R, Cuesta R, Paredes F.
europepmc +2 more sources
Initialization and Local Search Methods Applied to the Set Covering Problem: A Systematic Mapping
Revista Facultad de Ingeniería, 2023 The set covering problem (SCP) is a classical combinatorial optimization problem part of Karp's 21 NP-complete problems. Many real-world applications can be modeled as set covering problems (SCPs), such as locating emergency services, military planning,
Nelson-Enrique Quemá-Taimbud +2 more
openalex +4 more sources
Two Neighbourhood-based Approaches for the Set Covering Problem
U.Porto Journal of Engineering, 2019 The Set Covering Problem is a well-known NP-complete problem which we address in this work. Due to its combinatorial nature heuristic methods, namely neighbourhood-based meta-heuristics, were used.
Eduardo Castro
openalex +4 more sources
Spektrum Industri: Jurnal Ilmiah Pengetahuan dan Penerapan Teknik Industri, 2018 Bandar Lampung merupakan kota besar di Indonesia yang akan berkembang menjadi kota metropolitan. Perkembangan kota dapat dipercepat dengan pembangunan infrastruktur pelayanan publik.
Heri Wibowo +2 more
openalex +4 more sources
Application of genetic algorithm for the set-covering problem solution
Advanced Engineering Research, 2016 The weighed and unweighted minimal set-cover problem, its applicability for the solution of the major optimization practical tasks, such as arrangement of service points, assignment of crews in transport, as well as the integrated-circuit and conveyer ...
I. S. Konovalov +2 more
openalex +4 more sources
A Surprisal-Based Greedy Heuristic for the Set Covering Problem
Algorithms, 2023 In this paper we exploit concepts from Information Theory to improve the classical Chvatal greedy algorithm for the set covering problem. In particular, we develop a new greedy procedure, called Surprisal-Based Greedy Heuristic (SBH), incorporating the ...
Tommaso Adamo +3 more
openalex +4 more sources
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
openalex +3 more sources
Set Covering Problem in Transport Nets Expanding Models [PDF]
Transactions of the VŠB-Technical University of Ostrava, Mechanical Series, 2012 The article deals with the problem of optimal coverage of utility centres in transport network. We can often encounter similar types of tasks in a real life.
Dušan TEICHMANN +2 more
doaj +1 more source
Ant-Set: A Subset-Oriented Ant Colony Optimization Algorithm for the Set Covering Problem [PDF]
Journal of Universal Computer Science, 2020 This paper proposes an algorithm for the set covering problem based on the metaheuristic Ant Colony Optimization (ACO) called Ant-Set, which uses a lineoriented approach and a novelty pheromone manipulation based on the connections between components of ...
Murilo Falleiros Lemos Schmitt +4 more
doaj +3 more sources