Ceo rad - PDF (1.3 MB)

Literatura 185
⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯
http://www.mcs.anl.gov/mpi/mpich/
[Gro97] Gropp W., Lusk E., Doss N., Skjellum A., "MPICH Model MPI
Implementation: Reference Manual", Technical Report ANL-00, Argonne
National Laboratory, Department of Computer Science, University of
Chicago, 176 p. (1997).
[Grö95] Grötschel M., Monma C.L., Stoer M., "Polyhedral and Computational
Investigations for Designing Communication Networks with High
Survivability Requirements", Operations Research, Vol. 43, No. 6, pp.
1012-1024 (1995).
[Grs94] Grishukhin V.P., "On polynomial solvability conditions for the simplest
plant location problem", In: Selected topics in discrete mathematics,
Kelmans A.K. and Ivanov S. (eds), American Mathematical Society,
Providence, RI, pp. 37-46 (1994)
[Gui88] Guignard M., "A Lagrangean dual ascent algorithm for simple plant
location problems", European Journal of Operational Research, Vol. 35, pp.
193-200 (1988).
[Han99] Hansen P., Mladenović N., "An Introduction to Variable Neighborhood
Search", In: Meta-Heuristics: Advances and Trends in Local Search
Paradigms for Optimization, Voss S., Martello S., Osman I.H., Roucairol C.
(eds.), Kluwer Academic Publishers, pp. 433-458 (1999).
[Hat85] Hatzopoulos M., Kollias J.G., "On the selection of a reduced set of
indexes", The Computer Journal, Vol. 28, pp. 406-408 (1985).
[Hei93] Heitkoetter J., Beasley D., "The Hitch-Hiker's Guide to Evolutionary
computation", FAQ in comp.ai.genetic , (1993).
ftp://rtfm.mit.edu/pub/usenet/news.answers/ai-faq/genetic/
[Hel92] Hellstrand J., Larsson T., Migdalas A., "A Characterization of the
Uncapacitated Network Design Polytope", Operations Research Letters,
Vol. 12, pp. 159-163 (1992).
[Hel94] Helstrand J., Holmberg K., "A Lagrangean Heuristic Applied to the
Uncapacitated Network Design Problem", Technical Report LiTH-
MAT/OPT-WP-1994-04, Department of Mathematics, Linköping Institute of
Technology, Sweden (1994).
[Her97] Hertz A., Taillard E., de Werra D., "Tabu search", In: Local Search in
Combinatorial Optimization, Aarts E.H.L. and Lenstra J.K. (eds.), John
Wiley & Sons Ltd., pp. 121-136 (1997).
[Hil98] Hill J., Warren M., Goda P., ”Loki”, LINUX Journal, pp. 56-60, January
1998.
[Hll75] Holland J.H., "Adaptation in Natural and Artificial Systems", The University
of Michigan Press, Ann Arbor (1975).
[Hlm86] Holmberg K., Jörnsten K., Migdalas A., "Decomposition methods applied
to discrete network design", Technical Report LiTH-MAT/OPT-WP-1986-07,
Department of Mathematics, Linköping Institute of Technology, Sweden
(1986).
[Hlm90] Holmberg K., "On the Convergence of Cross Decomposition",
[Hlm91]
Mathematical Programming, Vol. 47, pp. 269-296 (1990).
Holmberg K., Migdalas A., "Solution Methods for the Discrete Choice
Network Design Problem Combining Lagrangean Relaxation and
Decomposition with Generation of Valid Inequalities", Technical Report
LiTH-MAT/OPT-WP-1991-07, Department of Mathematics, Linköping
Institute of Technology, Sweden (1991).
[Hlm95] Holmberg K., "Experiments with primal-dual decomposition and
subgradient methods for the uncapacitated facility location problem",
Research Report LiTH-MAT/OPT-WP-1995-08, Optimization Group,
Department of Mathematics, Linkoping Institute of Technology, Sweden
(1995).