scholarly journals An exact solution framework for the multiple gradual cover location problem

2019 ◽  
Vol 108 ◽  
pp. 82-96
Author(s):  
Eduardo Álvarez-Miranda ◽  
Markus Sinnl
Keyword(s):  
Exact Solution ◽  
Location Problem ◽  
Gradual Cover

The Location Problem of Given and Indivisible Different Units

1970 ◽  
Vol 2 (3) ◽  
pp. 341-356
Author(s):  
G. Jándy
Keyword(s):  
Exact Solution ◽  
Heuristic Algorithm ◽  
Network Flow ◽  
Location Problem ◽  
Optimal Solution ◽  
Type Problem ◽  
Distribution Problem ◽  
Enumeration Algorithm ◽  
Weighted Distribution ◽  
Partial Enumeration

In cases where certain simplifications are allowed, the location optimisation of given and indivisible different economic units may be modelled as a bi-value weighted distribution problem. The paper presents a heuristic algorithm for this network-flow-type problem and also a partial enumeration algorithm for deriving the exact solution. But it is also pointed out that an initial sub-optimal solution can quickly be improved with a derivation on a direct line only, if the exact solution is not absolutely essential. A numerical example is used to illustrate the method of derivation on a direct line starting with an upper bound given by a sub-optimal solution.

The multiple gradual cover location problem

2018 ◽  
Vol 70 (6) ◽  
pp. 931-940 ◽  
Author(s):  
Oded Berman ◽  
Zvi Drezner ◽  
Dmitry Krass
Keyword(s):  
Location Problem ◽  
Gradual Cover

A stochastic gradual cover location problem

2010 ◽  
Vol 57 (4) ◽  
pp. 367-372 ◽  
Author(s):  
Tammy Drezner ◽  
Zvi Drezner ◽  
Zvi Goldstein
Keyword(s):  
Location Problem ◽  
Gradual Cover

The maximin gradual cover location problem

OR Spectrum ◽  
2013 ◽  
Vol 36 (4) ◽  
pp. 903-921 ◽  
Author(s):  
Tammy Drezner ◽  
Zvi Drezner
Keyword(s):  
Location Problem ◽  
Gradual Cover
Sign in / Sign up

Export Citation Format

Share Document