Results 241 to 250 of about 1,714,979 (285)
Some of the next articles are maybe not open access.
Set Cover Problems with Small Neighborhood Covers
Theory of Computing Systems, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Agarwal, Archita +4 more
openaire +2 more sources
Hybrid Covering Location Problem: Set Covering and Modular Maximal Covering Location Problem
2019 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), 2019To benefit from the location advantages provided from two main covering location problems, namely set covering location problem and maximal covering location problem, a new mathematical model is presented in this study. In this model, the main facilities are located gradually through the planning periods, providing full coverage for the incremental ...
R. Alizadeh, T. Nishi
openaire +1 more source
Networks, 1991
AbstractThis paper studies the reliability covering problem, in which given routes provides service to various stops (e.g., of a transit system). If the routes are subject to failure, it is desired to find the probability that all stops will be covered by an operating route.
Ball, M. O., Provan, J. S., Shier, D. R.
openaire +3 more sources
AbstractThis paper studies the reliability covering problem, in which given routes provides service to various stops (e.g., of a transit system). If the routes are subject to failure, it is desired to find the probability that all stops will be covered by an operating route.
Ball, M. O., Provan, J. S., Shier, D. R.
openaire +3 more sources
The Probabilistic Set-Covering Problem
Operations Research, 2002In a probabilistic set-covering problem the right-hand side is a random binary vector and the covering constraint has to be satisfied with some prescribed probability. We analyze the structure of the set of probabilistically efficient points of binary random vectors, develop methods for their enumeration, and propose specialized branch-and-bound ...
BERALDI, Patrizia, RUSZCZYNSKI A.
openaire +3 more sources
Annals of Combinatorics, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Östergård, Patric R. J. +1 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Östergård, Patric R. J. +1 more
openaire +1 more source
The Minimum Covering Sphere Problem
Management Science, 1972The minimum covering sphere problem, with applications in location theory, is that of finding the sphere of smallest radius which encloses a set of points in En. For a finite set of points, it is shown that the Wolfe dual is equivalent to a particular quadratic programming problem and that converse duality holds.
D. Jack Elzinga, Donald W. Hearn
openaire +1 more source
2015
In covering location models, one seeks the location of facilities optimizing the weight of individuals covered, i.e., those at the distance from the facilities below a threshold value. Attractive facilities are wished to be close to the individuals, and thus the covering is to be maximized, while for repulsive facilities the covering is to be minimized.
Emilio Carrizosa, Boglárka G.-Tóth
openaire +1 more source
In covering location models, one seeks the location of facilities optimizing the weight of individuals covered, i.e., those at the distance from the facilities below a threshold value. Attractive facilities are wished to be close to the individuals, and thus the covering is to be maximized, while for repulsive facilities the covering is to be minimized.
Emilio Carrizosa, Boglárka G.-Tóth
openaire +1 more source
2015
When deciding where to locate facilities (e.g., emergency points where an ambulance will wait for a call) that provide a service, it happens quite often that a customer (e.g., a person) can receive this service only if he/she is under a certain distance to the closest facility (e.g., the ambulance can arrive in less than 7 min at this person’s home ...
Sergio García, Alfredo Marín
openaire +1 more source
When deciding where to locate facilities (e.g., emergency points where an ambulance will wait for a call) that provide a service, it happens quite often that a customer (e.g., a person) can receive this service only if he/she is under a certain distance to the closest facility (e.g., the ambulance can arrive in less than 7 min at this person’s home ...
Sergio García, Alfredo Marín
openaire +1 more source
Problems on star-covering properties
2007We consider some questions about properties defined in terms of stars with respect to open ...
BONANZINGA, Maddalena, MATVEEV M. V.
openaire +2 more sources
Navigating financial toxicity in patients with cancer: A multidisciplinary management approach
Ca-A Cancer Journal for Clinicians, 2022Grace Li Smith +2 more
exaly