Bibliografía especializada de apoyo al posgrado con especialidad en computación

 

No

Título

Num. control

ISBN

ISSN

1

Edmund Burke, Michael Trick (Eds.), Practice and Theory of Automated Timetabling V.  Springer.

Q340P62

ISBN-103-540-30705-2. ISBN-13978-3-540-30705-1

0302-9747

 

2

Bernhard Korte, Jens Vygen, Combinatorial Optimization Theory and algorithms, Springer. 

QA402.5 K67 2002

3-540-43154-3

0937-5511

3

Michael R. Garey, David S. Jonson, Computers and intractability a guide to the theory of NP- completeness . W.H. Freeman and Company.

 QA76.6G37

0-7167-1044-7,

0-7167-1045-5

 

4

Paolo Toth, Daniele Vigo Siam,.The Vehicle Routing Problem.

 

0-89871-579-2

 
5  F.S. Hillier, G.J. Lieberman, Introducción a la Investigación de Operaciones, Mc Graw Hill.      
6 M. Pinedo, Scheduling Theory, Algorithms and Systems,  Prentice Hall, USA., Aug. 2001.   0130281387  

7

Cristos H. Papadimitriou, Kenneth Steiglitz, Combinatorial Optimization algorithms and Complexity, Dover Publication, Inc.

 QA402.5P36

 0-486-40258-4

 
8 George B. Dantzing, Linear Programming and Extensions, Princeton University Press, U.S.A., 1998.

  ___

 0-691-05913-6  
9 Zbigniew Michalewicz, David B. Fogel, How to Solve It: Modern Heuristics, Springer, U.S.A., 2002.          ___ 3-540-66061-5  
10 J. Dréo, P. Siarry, A.  Pétrowski, A. Taillard, Metaheuristics for Hard Optimization, Methods and Case Studies,  springer, Germany, 2006.

____

 

 103-540-23022-X

 

  
11 Enrique Alba, Parallel Metaheuristics, A New Class of Algorithms, Wiley-Interscience, U.S.A., 2005.

____

 0-471-67806-9  
12 El-Ghazali Talbi, Parallel Combinatorial Optimization, Wiley-Interscience, U.S.A., 2006.

_____

 0-471-72101-8  
13 A. V. Aho, J. E. Hopcroft, J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley.

_____

 0-201-00029-6  
14 S. Baase, Computer Algorithms, Introduction to Design and Analysis,  Addison-Wesley, U.S.A., 1993.

____

 0-201-06035-3  
15        
16