Results 31 to 40 of about 1,486,783 (327)
Algorithms for connected set cover problem and fault-tolerant connected set cover problem
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Zhao, Gao, Xiaofeng, Wu, Weili
openaire +1 more source
Approximation Algorithm for Line Segment Coverage for Wireless Sensor Network
The coverage problem in wireless sensor networks deals with the problem of covering a region or parts of it with sensors. In this paper, we address the problem of covering a set of line segments in sensor networks.
A. Agnetis +20 more
core +1 more source
A Binary Fruit Fly Optimization Algorithm to Solve the Set Covering Problem [PDF]
The Set Covering Problem (SCP) is a well known NP-hard problem with many practical applications. In this work binary fruit fly optimization algorithms (bFFOA) were used to solve this problem using different binarization methods.
Crawford, Broderick +7 more
core +1 more source
The dynamic set covering próblem
This paper addresses a dynamic version of the set covering formulation for facility location problems. The problem is characterized by 0–1 cover coefficients that may change value from one time period to the next. Included is a discussion of model formulation considerations, solution procedures and applications areas.
Chrissis, James W. +2 more
openaire +1 more source
A set-covering formulation for a drayage problem with single and double container loads
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
Greedy Genetic Algorithm for the Data Aggregator Positioning Problem in Smart Grids
In this work, we present a metaheuristic based on the genetic and greedy algorithms to solve an application of the set covering problem (SCP), the data aggregator positioning in smart grids.
Sami Nasser Lauar, Mario Mestria
doaj +1 more source
Efficiency comparison of exact and approximate algorithms for solving set covering problem
Introduction. A quite general class of practical tasks is guided by the set covering problem: schedules building, layout of service stations, and creation of electronic circuits.
Igor S. Konovalov +2 more
doaj +1 more source
Covering problems in edge- and node-weighted graphs
This paper discusses the graph covering problem in which a set of edges in an edge- and node-weighted graph is chosen to satisfy some covering constraints while minimizing the sum of the weights. In this problem, because of the large integrality gap of a
A. Berger +18 more
core +1 more source
Application of Set Covering Location Problem for Organizing the Public Postal Network
Most countries of the European Union ensure certain obligations (criteria) which universal service providers must meet to ensure the realization of the universal service.
Dragana Šarac +4 more
doaj +1 more source
ABSTRACT Neuroblastoma is the most common extracranial solid tumor in early childhood. Its clinical behavior is highly variable, ranging from spontaneous regression to fatal outcome despite intensive treatment. The International Society of Pediatric Oncology Europe Neuroblastoma Group (SIOPEN) Radiology and Nuclear Medicine Specialty Committees ...
Annemieke Littooij +11 more
wiley +1 more source

