Results 61 to 70 of about 1,485,911 (189)
The Minimization of Public Facilities With Enhanced Genetic Algorithms Using War Elimination
IEEE Access, 2019 In this paper, we focus on the problem of minimizing a network of state facilities that provide essential public services (schools, offices, and hospitals).
Pavel Seda +5 more
doaj +1 more source
Set It and Forget It: Approximating the Set Once Strip Cover Problem [PDF]
, 2012 We consider the Set Once Strip Cover problem, in which n wireless sensors are deployed over a one-dimensional region. Each sensor has a fixed battery that drains in inverse proportion to a radius that can be set just once, but activated at any time.
Bar-Noy, Amotz +2 more
core
Replica Placement on Bounded Treewidth Graphs
, 2017 We consider the replica placement problem: given a graph with clients and nodes, place replicas on a minimum set of nodes to serve all the clients; each client is associated with a request and maximum distance that it can travel to get served and there ...
B Saha +6 more
core +1 more source
An indirect genetic algorithm for set covering problems [PDF]
Journal of the Operational Research Society, 2002 This paper presents a new type of genetic algorithm for the set covering problem. It differs from previous evolutionary approaches first because it is an indirect algorithm, i.e. the actual solutions are found by an external decoder function. The genetic algorithm itself provides this decoder with permutations of the solution variables and other ...
openaire +6 more sources
Solution techniques for the Large Set Covering Problem
Discrete Applied Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Galinier, Philippe, Hertz, Alain
openaire +3 more sources
Covering Pairs in Directed Acyclic Graphs
, 2013 The Minimum Path Cover problem on directed acyclic graphs (DAGs) is a classical problem that provides a clear and simple mathematical formulation for several applications in different areas and that has an efficient algorithmic solution.
B.Y. Wu +7 more
core +1 more source
Weighted geometric set cover problems revisited
Journal of Computational Geometry, 2012 We study several set cover problems in low dimensional geometric settings. Specifically, we describe a PTAS for the problem of computing a minimum cover of given points by a set of weighted fat objects. Here, we allow the objects to expand by some prespecified δ-fraction of their diameter.
Sariel Har-Peled, Mira Lee
openaire +2 more sources
The complete vertex p-center problem
EURO Journal on Computational Optimization, 2020 The vertex p-center problem consists of locating p facilities among a set of M potential sites such that the maximum distance from any demand to its closest located facility is minimized.
F.Antonio Medrano
doaj +1 more source
Calibrations for minimal networks in a covering space setting
, 2019 In this paper we define a notion of calibration for an equivalent approach to the classical Steiner problem in a covering space setting and we give some explicit examples. Moreover we introduce the notion of calibration in families: the idea is to divide
Carioni, Marcello, Pluda, Alessandra
core +1 more source