You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
178 Paralelizacija GA za rešavanje nekih NP-kompletnih problema<br />
⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯<br />
[Art97a] Aarts E., Lenstra J.K., "Local Search in Combinatorial Optimization", John<br />
Wiley & Sons, Baffins Lane, Chichester, UK (1997).<br />
[Art97b] Aarts E.H.L., Korst J.H.M., van Laarhoven P.J.M., "Simulated annealing",<br />
In: Local Search in Combinatorial Optimization, Aarts E.H.L. and Lenstra<br />
J.K. (eds.), John Wiley & Sons Ltd., pp. 91-120 (1997).<br />
[Bak98] Baker M.A., Fox G.C., ”MPI on NT: A Preliminary Evaluation of the<br />
Available Environments”, Lecture Notes in Computer Science, Jose<br />
Rolim (Ed.), Parallel and Distributed Computing, Springer Verlag,<br />
Heidelberg, Germany, (1998).<br />
ISBN 3-540 64359-1 (12th IPPS & 9th SPDP Conference, Orlando, USA).<br />
http://www.sis.port.ac.uk/~mab/Papers/PC-NOW/<br />
[Bar90] Barcucci E., Pinzani R., Sprugnoli R., "Optimal Selection of Secondary<br />
Indexes", IEEE Transactions on Software Engineering, Vol. 16, pp. 32-38<br />
(1990).<br />
[Bas87] Bastay G., Turesson B.O., Hellstrand J., "A comparison between<br />
decomposition methods for the discrete network design problem", LiU-<br />
MAT-EX-87-62, Linköping University, Sweden (1987).<br />
[Bat93] Battle D., Vose M.D., "Isomorphisms of genetic algorithms", Artificial<br />
Intelligence, Vol. 60, pp. 155-165 (1993).<br />
[Bay91] Bayer S.E., Wang L., "A genetic algorithm programming environment:<br />
Splicer". In: Proceedings of the 1991 IEEE International Conference on<br />
Tools with Artificial Intelligence - TAI'91, pp. 138-144, IEEE Computer<br />
Society Press, Los Alamitos (1991).<br />
[BeD93a] Beasley D., Bull D.R., Martin R.R., "An Overview of Genetic Algorithms,<br />
Part 1, Fundamentals", University Computing, Vol. 15, No. 2, pp. 58-69<br />
(1993).<br />
ftp://ralph.cs.cf.ac.uk/pub/papers/GAs/ga_overview1.ps<br />
[BeD93b] Beasley D., Bull D.R., Martin R.R., "An Overview of Genetic Algorithms,<br />
Part 2, Research Topics", University Computing, Vol. 15, No. 4, pp. 170-<br />
181 (1993).<br />
ftp://ralph.cs.cf.ac.uk/pub/papers/GAs/ga_overview2.ps<br />
[BeJ88] Beasley J.E., "An algorithm for solving large capacitated warehouse<br />
location problems", European Journal of Operational Research, Vol. 33,<br />
No. 3, pp. 314-325 (1988).<br />
[BeJ90a] Beasley J.E., "OR Library: distributing test problems by electronic mail",<br />
Journal of the Operational Research Society, Vol. 41, pp. 1069-1072<br />
(1990).<br />
[BeJ90b] Beasley J.E., "A Lagrangean heuristic for set-covering problems", Naval<br />
Research Logistics, Vol. 37, pp. 151-164 (1990).<br />
[BeJ93] Beasley J.E., "Lagrangean heuristic for location problems", European<br />
Journal of Operational Research, Vol. 65, No. 3, pp. 383-399 (1993).<br />
[BeJ95] Beasley J.E., "Lagrangean Relaxation", In: Modern Heuristic Techniques<br />
for Combinatorial Problems, Reeves C.R.(ed), McGraw-Hill, pp. 243-303<br />
(1995).<br />
[BeJ96a] Beasley J.E., "Obtaining test problems via internet", Journal of Global<br />
Optimization, Vol. 8, pp. 429-433 (1996)<br />
http://mscmga.ms.ic.ac.uk/info.html<br />
[BeJ96b] Beasley J.E., Chu P.C., "A genetic algorithm for the set covering problem",<br />
European Journal of Operational Research, Vol. 94, pp. 392-404 (1996).<br />
http://www.dai.ed.ac.uk/groups/evalg/Local_Copies_of_Papers/Beasley.Ch<br />
u.A_Genetic_Algorithm_for_the_Set_Covering_Problem.ps.gz<br />
[Ber89] Bertsekas D.P., Tsitsiklis J.N., "Parallel and Distributed Computation:<br />
Numerical Methods", Prentice-Hall International, 715 p (1989).
Change language