Results 51 to 60 of about 149,933 (163)
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
Survey of 8 UAV Set-Covering Algorithms for Terrain Photogrammetry
Remote Sensing, 2020 Remote sensing with unmanned aerial vehicles (UAVs) facilitates photogrammetry for environmental and infrastructural monitoring. Models are created with less computational cost by reducing the number of photos required.
Joshua E. Hammond +8 more
doaj +1 more source
Test Sets for Vertex Cover Problems
Electronic Notes in Discrete Mathematics, 1999 Abstract We describe the structure of the unique minimal test set T for a family of vertex cover problems. The set T corresponds to the Grobner basis of the binomial ideal for the problem as described in [1]. While T has a surprisingly simple structure, in particular when the underlying graph is complete, it is N P -complete to decide whether ...
M. Hayer, Winfried Hochstättler
openaire +1 more source
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
A multi-objective set covering problem: A case study of warehouse allocation in truck industry [PDF]
Management Science Letters, 2011 Designing distribution centers is normally formulated in a form of set covering where is primary objective is to minimize the number of connected facilities.
Atefeh Malekinezhad +2 more
doaj
Sensors, 2017 The performance of a passive radar network can be greatly improved by an optimal radar network structure. Generally, radar network structure optimization consists of two aspects, namely the placement of receivers in suitable places and selection of ...
Rui Xie +3 more
doaj +1 more source
ComputationThe partial coverage weighted set covering problem (PCWSCP) allows for less than 100% of the rows to be satisfied in a weighted set covering problem (WSCP).
Myung Soon Song +3 more
doaj +1 more source
Risk Management and Healthcare Policy, 2021 Yufan Deng,1,2 Yumeng Zhang,1,2 Jay Pan1,2 1HEOA Group, West China School of Public Health and West China Fourth Hospital, Sichuan University, Chengdu, Sichuan, People’s Republic of China; 2Institute for Healthy Cities and West China Research ...
Deng Y, Zhang Y, Pan J
doaj
Urban railway logistics node location based on the set covering problem and heuristic algorithm
Computational Urban ScienceAt present, China's total demand for railway construction at home and abroad is at a historically high level. Under the huge construction demand, it is particularly important to reduce the logistics and transportation costs in railway construction.
Xiang Li
doaj +1 more source
BarekengThe rapid development of Palembang City comes with an increase in population and a proportionate increase in waste. Providing Temporary Waste Disposal Sites (TWDS) with ideal locations is one way to address the waste problem in Palembang City.
Sisca Octarina +7 more
doaj +1 more source