Ceo rad - PDF (1.3 MB)

180 Paralelizacija GA za rešavanje nekih NP-kompletnih problema
⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯
ftp://info.mcs.anl.gov/pub/p4/p4-1.4.tar.Z
[Cal94] Calkin R., Hempel R., Hoppe H., Wypior P., ”Portable Programming with
the PARMACS Message-Passing Library”, Parallel Computing, Vol. 20 -
Special issue on message-passing interfaces, pp. 615-632 (April 1994).
[Cap95a] Caprara A., Fischetti M., Maio D., "Exact and Approximate Algorithms for
the Index Selection Problem in Physical Database Design", IEEE
Transactions on Knowledge and Data Engineering, Vol. 7, No. 6, pp. 955-
967 (December 1995).
[Cap95b]
Caprara A., Salazar J.J., "A Branch-and-Cut Algorithm for the Index
Selection Problem", Technical Report OR-95-9, DEIS Operations Research
Group, University of Bologna, Italy (1995).
http://promet4.deis.unibo.it/~alberto/isp96.ps
[Cap96] Caprara A., Salazar J.J., "A Branch-and-Cut Algorithm for a
Generalization of the Uncapacitated Facility Location Problem", TOP, Vol.
4, pp. 135-163 (1996).
[Chd97]
[Che93]
[CHI91]
[CHI92]
[Chu97a]
[Chu97b]
[Coh91]
[Col91]
[Com78]
[Con90]
Chudak F.A., "Improved approximation algorithms for uncapacitated facility
location", In: Lecture Notes in Computer Science, Vol. 1412 (1997)
ftp://ftp.hpc.uh.edu/pub/ipco98/chudak.ps
Cherkassky B.V., Goldberg A.V., Radzik T., "Shortest paths algorithms:
Theory and experimental evaluation", Technical Report STAN-CS-93-1480,
Stanford University, Computer Science Department, Stanford, CA (1993).
ftp://theory.stanford.edu/pub/goldberg/stan-CS-93-1480.ps.gz
"CHIMP Concepts", Edinburgh Parallel Computing Centre, University of
Edinburgh, UK, June 1991.
"CHIMP Version 1.0 Interface", Edinburgh Parallel Computing Centre,
University of Edinburgh, UK, May 1992.
Chu P.C., "A genetic algorithm approach for combinatorial optimisation
problems", PhD thesis, University of London, Imperial College of Science -
The Management School (1997).
http://mscmga.ms.ic.ac.uk/pchu/ps/thesis.ps.gz
Chu P.C., Beasley J.E., "A genetic algorithm for the generalised
assignment problem", Computers and Operations Research, Vol. 24, pp.
17-23 (1997).
Cohoon J., Martin W., Richards D., "Genetic algorithms and punctuated
equilibria in VLSI", In: Parallel Problem Solving from Nature - PPSN,
Schwefel H.P. and Manner R. (eds.), Springer-Verlag, Berlin, pp. 134-144
(1991).
Collins R.J., Jefferson D.R., "Selection in massively parallel genetic
algorithms", In: Proceedings of the Fourth International Conference on
Genetic Algorithms, Morgan Kaufmann, San Mateo, Calif., pp. 249-256
(1991).
Comer D., "The difficulty of optimum index selection", ACM Transactions
on Database Systems, Vol. 3, pp. 440-445 (1978).
Conn A.R., Cornuejols G., "A projection method for the uncapacitated
facility location problem", Mathematical Programming, Vol. 46, pp. 273-298
(1990).
[Cook71] Cook S.A., "The complexity of theorem-proving procedures", In:
Proceedings of Third Annual ACM Symposium on the Theory of
Computing, pp. 151-158 (1971).
[Cox91]
[Cre97]
Cox L.A., Davis L., Qiu Y., "Dynamic anticipatory routing in circuitswitched
telecommunication networks", In: Handbook of Genetic
Algorithms, Davis L. (ed), pp. 124-143, Van Nostrad Reinhold, New York,
NY (1991).
Crescenci P., Kann V., "A compendium of NP optimization problems"
(1997). http://www.nada.kth.se/theory/problemlist.html