REFERENCIAS

[Apsotol 1969] Apostol T. M.: Calculus. Ed. Wiley International Edition, 2a ed. vol. II,
USA, (1969).
[Barr 2001] Barr R.S., Golden B.L., Kelly J., Steward W.R., Resende M.: Guidelines for
Designing and Reporting on Computational Experiments with Heuristic Methods.
Proceedings of International Conference on Metaheuristics for Optimization. Kluwer
Publishing, Norwell, MA (2001) 1-17

[Watkins 2006] Watkins S. F., Crystal Lattice Structures: Face Centered Cubic,
http://wb.chem.lsu.edu/htdocs/people/sfwatkins/MERLOT/lattice/04fcc.html,

fecha

de

consulta: 2 de Marzo de 2015.

[Dueck 1990] Dueck G., Scheuer T.: Threshold Accepting: A General Purpose
Optimization Algorithm Appearing Superior to Simulated Annealing. J. Comput. Phy.
Vol 90. (1990) 161-175
[Feo 1995] Feo T., Resende M.: Greedy Randomized Adaptive Search Procedures.
Journal Global Optimization, No. 6. (1995) 109-133
[Fraire 2005] Fraire H.: Una metodologa para el diseo de la fragmentacin y ubicacin
en grandes bases de datos distribuidas. Tesis doctoral. CENIDET, Cuernavaca, Mxico
(2005)
[Garey 1979] Garey M.R., Johnson D.S.: Computer and intractability: a Guide to the
Theory of NP-Completeness. WH Freeman, New York (1979)
[Glover 1986] Glover F.: Future Paths for Integer Programming and Links to Artificial
Intelligence. Comput. Oper. Res. Vol 13. (1986) 533-549
[Glover 1997] Glover F., Laguna M.: Tabu Search. Kluwer Academic Publishers (1997)

[Matlab 2004] Matlab Help, Versin 7.0.0.19920 (R14)

[McGeoch 1992] McGeoch C.C.: Analyzing Algorithms by Simulation: Variance
Reduction Techniques and Simulation Speedups. ACM Computer Survey. Vol. 24 No. 2.
(1992) 1995-212

[McGeoch 2002] McGeoch C.C.: Experimental Analysis of Algorithms. In: Pardalos, P.M.,
Romeijn, H.E. (eds.): Handbook of Global Optimization, Vol. 2 (2002) 489-513
[Meyer 2001]
http://www.hermetic.ch/compsci/lattgeom.htm

Meyer.

P.,Lattice

Geometries,

[Michalewicz 1999] Michalewicz, Z., Fogel D.B.: How to Solve It: Modern Heuristics.
Springer Verlag (1999)
[Mor 1983] Mor, J.J., Sorensen D.C.: Computing a Trust Region Step. SIAM Journal
on Scientific and Statistical Computing, Vol. 3, pp 553-572, 1983.
[Neos

1996]

NEOS

Guide,

NEOS

Guide

Optimization

Tree,

http://www-

fp.mcs.anl.gov/otc/Guide/OptWeb/index.html
[Neumaier 1997] Neumaier A.: Molecular Modeling of Proteins and Mathematical
Prediction of Protein Structure. SIAM Review, Vol. 39(3). (1997) 407-460
[Oviedo

2005]

Universidad

de

Oviedo,

Dibujo

Asistido

por

Ordenador,

http://www.mieres.uniovi.es/egi/dao/apuntes/trans3d.html
[Prez 2002] Prez J., Pazos R.A., Vlez L., Rodrguez G.: Automatic Generation of
Control Parameters for the Threshold Accepting Algorithm. Lectures Notes in Computer
Science, Vol. 2313. Springer Verlag, Berlin Heidelberg New York (2002) 119-127
[Prez 2004] Prez J., Pazos R.A., Frausto J., Rodrguez G., Cruz L., Mora G., Fraire H.:
Self-Tuning Mechanism for Genetic Algorithms Parameters, an Application to Data-

Object Allocation in the Web. Lectures Notes in Computer Science, Vol. 3046. Springer
Verlag, Berlin Heidelberg New York (2004) 77-86
[Resende 2003] Resende M. G. C., Gonzlez Velarde J. L.: GRASP: Procedimientos de
Bsqueda Miopes Aleatorizados y Adaptativos. Inteligencia Artificial, No. 19. (2003)
61-76
[Sanvicente 2004] Sanvicente H., Frausto-Sols J.: A Method to Establish the Cooling
Scheme in Algorithms Like Simulated Annealing. Lecture Notes in Computer Science.
Vol. 3045. Springer Verlag Berlin Heidelberg New York. (2004) 755-763
[Shao 2004a] X. Shao, Y. Xiang, H. Jiang, y W. Cai, An efficient method based on lattice
construction and the genetic algorithm for optimization of large Lennard-Jones clusters, J.
Phys. Chem. A.108, 2004, pp. 3586-3592
[Shao 2004b] X. Shao, Y. Xiang, L. Cheng, y W. Cai, Structural distribution of LennardJones clusters containing 562 to 1000 atoms, J. Phys. Chem. A.108, 2004, pp. 9516-9520
[Shao 2005] X. Shao, Y. Xiang, y W. Cai, Structural transition from icosahedra to
decahedra of large Lennard-Jones clusters, J. Phys. Chem. A.109, 2005, pp. 5193-5197
[Shores 2005] Shaores Thomas S., Public Directory Page, disponible:
http://www.math.unl.edu/~tshores1/Public/Math433S05/uncprobs/
[Wales 1999] Wales D. J., Scheraga H. A.: Global Optimization of Clusters, Crystals and
Biomolecules. Science, Vol. 285. (1999) 1368-1372
[Xue 1992] Xue G.L., Maier R.S., Rosen J.B.: A discrete-continuous algorithm for
molecular energy minimization. IEEE Computer Society Press. (1992) 778-786
[Yagiura 2001] Yagiura M., Ibaraki T.: On Metaheuristic Algorithms for Combinatorial
Optimization Problems: The Transactions of Institute of Electronics, Information and
Communication Engineers. J83-D-1(1), (2001) 3-25