Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
186 Paralelizacija GA za rešavanje nekih NP-kompletnih problema<br />
⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯<br />
http://www.mai.liu.se/~kahol/abstracts/Abstr-ULoc.txt<br />
[Hlm97a] Holmberg K., Ling J., "A Lagrangean Heuristic for the Facility Location<br />
Problem with Staircase Costs", European Journal of Operational Research,<br />
Vol. 97, pp. 63-74 (1997).<br />
http://www.mai.liu.se/~kahol/papers/Rep-ScLoc.ps.gz<br />
[Hlm97b] Holmberg K., Hellstrand J., "Solving the uncapacitated network design<br />
problem by a Lagrangean heuristic and branch-and-bound", Operations<br />
Research (1997).<br />
http://www.mai.liu.se/~kahol/papers/Rep-NDbabsub.ps.gz<br />
[Hmf93] Homaifar A., Guan S., Liepins G.E., "A New Approach on the Traveling<br />
Salesman Problem by Genetic Algorithms", In: Proceedings of the Fifth<br />
International Conference on Genetic Algorithms, Morgan Kaufmann, San<br />
Mateo, Calif., pp. 460-466 (1993).<br />
[Hmf94] Homaifar A., Lai S.H., Qi X., "Constrained optimization via genetic<br />
algorithms, Simulation, Vol. 62, pp. 242-254 (1994).<br />
[Hoc91] Hockney R., ”Performance parameters and benchmarking of<br />
supercomputers”, Parallel Computing, Vol. 17, pp. 1111-1130 (1991).<br />
[Hoc94] Hockney R., Berry M., ”Public international benchmarks for parallel<br />
computers”, parkbench committee report, Scientific Programming, Vol. 3,<br />
No. 2, pp. 101-146 (1994).<br />
[Hof91] Hoffmeister F., "The User's Guide to Escapade 1.2: A Runtime<br />
Environment for Evolution Strategies", Department of Computer Science,<br />
University of Dortmund, Germany (1991).<br />
[Hou95] Houck C.R., Joines J.A., Kay M.G., "Comparison of Genetic Algorithms,<br />
Random Restart, and Two-Opt Switching for Solving Large Location-<br />
Allocation Problems", Techical Report, Department of Industrial<br />
Engineering, North Carolina State University, Raleigh, NC (1995).<br />
ftp://ftp.eos.ncsu.edu/pub/simul/GAOT/papers/gala.ps.gz<br />
[Hug89] Hughes M., "Genetic Algorithm Workbench Documentation", Cambridge<br />
Consultants, Cambridge, UK (1989).<br />
[Ip83] Ip M.Y.L., Saxton L.V., Raghavan V.V., "On the Selection of an Optimal<br />
Set of Indexes", IEEE Transactions on Software Engineering, Vol. 9, pp.<br />
135-143 (1983).<br />
[Jan91] Janikow C.Z., Michalewicz Z., "An Experimental Comparasion of Binary<br />
and Floating Point Representations in Genetic Algorithms", In: Proceedings<br />
of the Fourth International Conference on Genetic Algorithms - ICGA '91,<br />
Morgan Kaufmann, San Mateo, Calif., pp. 37-44 (1991).<br />
[Jog89] Jog P., Suh J.Y., Van Gucht D., "The effects of Population size, Heuristic<br />
Crossover and Local Improvement on a Genetic Algorithm for the Traveling<br />
Salesman Problem", In: Proceedings of the Third International Conference<br />
on Genetic Algorithms, Morgan Kaufmann, San Mateo, Calif., pp. 110-115<br />
(1989).<br />
[Jog90] Jog P., Suh J.Y., Van Gucht D., "Parallel Genetic Algorithms Applied to<br />
the Traveling Salesman Problem", Technical Report 314, Indiana University<br />
(1990).<br />
[Joh77] Johnson D.S., "Efficient algorithms for shortest paths in sparse networks",<br />
Journal of the ACM, Vol. 24, No. 1, pp. 1-13 (1977).<br />
[Joh78] Johnson D.S., Lenstra J.K., Rinnooy Kan A.H.G., "The Complexity of the<br />
Network Design Problem", Networks, Vol. 8, pp. 279-285 (1978).<br />
[Joh97] Johnson D.S., McGeoch L.A., "The Traveling Salesman Problem: A Case<br />
Study in Local Optimization", Local Search in Combinatorial Optimization,<br />
eds. Aarts E.H.L., Lenstra J.K., John Wiley & Sons Ltd., pp. 215-310<br />
(1997).
Change language