Search Results - subject:"Covering problems"

Narrow search

Did you mean: subject:"Covering problem" (659 results)

On covering location problems on networks with edge demand

Berman, Oded; Kalcsics, Jörg; Krass, Dmitry - In: Computers & operations research : and their … 74 (2016), pp. 214-227

Persistent link: https://www.econbiz.de/10011514249

Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems

Glover, Fred - In: European Journal of Operational Research 230 (2013) 2, pp. 212-225

New variants of greedy algorithms, called advanced greedy algorithms, are identified for knapsack and covering problems … multiple knapsack and covering problems, in which objects must be allocated to different knapsacks and covers, and also for … multi-constraint (multi-dimensional) knapsack and covering problems, in which the constraints are exploited by means of …

Persistent link: https://www.econbiz.de/10010679110

Concepts and Applications of Backup Coverage

Hogan, Kathleen; ReVelle, Charles - In: Management Science 32 (1986) 11, pp. 1434-1444

Backup coverage, the second coverage of a demand node, is suggested as a decision criterion in modelling the location of emergency services on a network. The efficient handling of stochastic demand by vehicles which can respond to only one call at a time may require backup coverage in areas of...

Persistent link: https://www.econbiz.de/10009204508

The Hierarchical Service Location Problem

Moore, George C.; ReVelle, Charles - In: Management Science 28 (1982) 7, pp. 775-780

A location problem with a hierarchy of facilities and services is proposed and solved. The formulation defines a demand point to be covered for a given level of service if some member of the facility hierarchy eligible to provide that service is present within an appropriate distance....

Persistent link: https://www.econbiz.de/10009191644