haku: @indexterm location problem / yhteensä: 219
viitteet: 206-215 / 219
« edellinen sivu | seuraava sivu »
 otsikkovuositekijä
206.
An approximate procedure for determining the number, capacities and locations of solid waste transfer-stations in an urban region.
European Journal of Operational Research
1983 : JAN, VOL. 12:1, p. 105-111
 1983 Wirasinghe, S. C.
Waters, N. M.
207.
An algorithm for a constrained Weber problem.
Management Science
1982 : NOV, VOL. 28:11, p. 1285-1295
 1982 Hansen, P.
Peeters, D.
Thisse, J-F.
208.
Parametric mixed integar programming : an application to solid waste management.
Management Science
1982 : NOV, VOL. 28:11, p. 1270-1284
 1982 Jenkins, L.
209.
A dual-based procedure for dynamic facility location.
Management Science
1982 : OCT, VOL. 28:10, p. 1091-1105
 1982 Roy, T. J. von
Erlenkotter, D.
210.
Duality and distance constraints for the nonlinear p-center problem and covering problem on a tree network.
Operations Research
1982 : JUL-AUG, VOL. 30:4, p. 725-744
 1982 Tansel, B. C.
211.
Optimal locations on a line are interleaved.
Operations Research
1982 : JUL-AUG, VOL. 30:4, p. 745-759
 1982 Denardo, E. V.
Huberman, G.
Rothblum, U. G.
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.
« edellinen sivu | seuraava sivu »
SCIMA