search query: @indexterm location problem / total: 219
references: 212-219 / 219
« previous page | next page »
 titleyearauthor
212.
Efficient algorithms for the (weighted) minium circle problem.
Operations Research
1982 : JUL-AUG, VOL. 30:4, p. 777-795
 1982 Hearn, D. W.
Vijay, J.
213.
The hierarchical service location problem.
Management Science
1982 : JUL, VOL. 28:7, p. 775-780
 1982 Moore, G. C.
ReVelle, C.
214.
Dynamic versions of set covering type public facility location problems.
European Journal of Operational Research
1982 : JUN, VOL. 10:2, p. 190-195
 1982 Gunawardane, G.
215.
Extension of the Elzinga-Hearn algorithm to the weighted case.
Operations Research
1982 : MAY-JUN, VOL. 30:3, p. 591-594
 1982 Charalambous, C.
216.
The delimitation of local government electoral areas in Scotland : a semiautomated approach.
Journal of the Operational Research Society
1982 : JUN, VOL. 33:6, p. 517-525
 1982 Robertson, I. M. L.
217.
A note on the set covering problem.
Journal of the Operational Research Society
1982 : MAR, VOL. 33:3, p. 261-265
 1982 Benveniste, R.
218.
Reformulating a logistics strategy : a concern for the past, present and future.
International Journal of Physical Distribution and Materials Management
1981 : VOL. 11:8, p. 71-83
 1981 Ballou, R. H.
219.
Bounds in the generalized weber problem under locational uncertainty.
Operations Research
1981 : NOV-DEC, VOL. 29:6, p. 1219-1227
 1981 Juel, H.
« previous page | next page »
SCIMA