C. Blum and M. Blesa. Optimization Techniques for Solving Complex Problems, chapter 23: Solving the KCT Problem: Large-scale Neighborhood Search and Solution Merging, pages 401-415. E. Alba, C. Blum, P. Isasi, C. León, and J.A. Gómez (eds.), Wiley Inc., 2008. In press.

M. Blesa and C. Blum. Handbook of Approximation Algorithms and Metaheuristics, volume 10 of Chapman & Hall/CRC Computer & Information Science Series, chapter 64: On Solving the Maximum Disjoint Paths Problem with Ant Colony Optimization. Taylor & Francis Group (CRC Press), Boca Raton, Florida, 2007.

M. Blesa, J. Petit, and F. Xhafa. Ciencia y Tecnología, volume 2, chapter Computación en Internet: Librería MALLBA para problemas de optimización, pages 15-18. Tibidabo Edicions, 2001. Legal dip.: B-36.375/2001.

M. Blesa, C. Blum, A. Roli, and M. Sampels, editors. Hybrid Metaheuristics: An Emerging Approach to Optimization, volume 114 of Studies in Computational Intelligence. Springer-Verlag GmbH, 2008.

T. Bartz-Beielstein, M. Blesa, C. Blum, B. Naujoks, A. Roli, G. Rudolph, and M. Sampels, editors. Hybrid Metaheuristics: Fourth International Workshop, HM 2007, Dortmund, Germany, October 8-9, 2007, volume 4771 of Lecture Notes in Computer Science. Springer-Verlag GmbH, 2007.

F. Almeida, M. Blesa, C. Blum, J.M. Moreno, M. Pérez, A. Roli, and M. Sampels, editors. Hybrid Metaheuristics: Third International Workshop, HM 2006, Gran Canaria, Spain, October 13-15, 2006, volume 4030 of Lecture Notes in Computer Science. Springer-Verlag GmbH, 2006.

M. Blesa, C. Blum, A. Roli, and M. Sampels, editors. Hybrid Metaheuristics: Second International Workshop, HM 2005, Barcelona, Spain, August 29-30, 2005, volume 3636 of Lecture Notes in Computer Science. Springer-Verlag GmbH, 2005.

M. Blesa, D. Calzada, A. Fernández, L. López, A.L. Martínez, A. Santos, M. Serna, and C. Thraves. Adversarial queueing model for continuous network dynamics. Theory of Computing Systems, 2008. Accepted for publication.

C. Blum, M. Yábar-Vallès, and M. Blesa. An ant colony optimization algorithm for DNA sequencing by hybridization. Computers & Operations Research, 35(11):3620-3635, November 2008.

M. Blesa and C. Blum. Finding edge-disjoint paths in networks: An ant colony optimization algorithm. Journal of Mathematical Modelling and Algorithms, 6(3):361-391, September 2007.

E. Alba, F. Almeida, M. Blesa, C. Cotta, M. Díaz, I. Dorta, J. Gabarró, C. León, G. Luque, J. Petit, C. Rodríguez, A. Rojas, and F. Xhafa. Efficient parallel LAN/WAN algorithms for optimization. the MALLBA project. Parallel Computing, 32(5-6):415-440, June 2006.

M. Blesa, J. Petit, and F. Xhafa. Generic parallel implementations for Tabu Search. International Journal of Computer Systems Science and Engineering, 21(6):413-432, November 2006.

C. Blum and M. Blesa. New metaheuristic approaches for the edge-weighted k-cardinality tree problem. Computers & Operations Research, 32(6):1355-1377, June 2005.

C. àlvarez, M. Blesa, J. Díaz, A. Fernández, and M. Serna. Adversarial models for priority-based networks. Networks, 45(1):23-35, January 2005.

C. àlvarez, M. Blesa, J. Díaz, A. Fernández, and M. Serna. The complexity of deciding stability under FFS in the adversarial model. Information Processing Letters, 90(5):261-266, June 2004.

C. àlvarez, M. Blesa, and M. Serna. A characterization of universal stability in the adversarial queueing model. SIAM Journal on Computing, 34(1):41-66, October 2004.

M. Blesa. Abstract of PhD Thesis: Stability in Communication Networks under Adversarial Models. Bulletin of the European Association on Theoretical Computer Science (EATCS), 89:219-221, June 2006.

M. Blesa and C. Georgiou. A report from DISC 2005, the 19th International Symposium on Distributed Computing. Bulletin of the European Association on Theoretical Computer Science (EATCS), 88:84-103, February 2006.

C. Blum and M. Blesa. Optimització mitjançant colònies de formigues artificials. Bulletin of the Catalan Association of Artificial Intelligence (ACIA Newsletters), 33:25-26, 2005. Review on the conference of M. Dorigo at the CosmoCaixa Museum in Barcelona. In Catalan.

C. Blum and M. Blesa. Probabilistic Beam Search for the Longest Common Subsequence Problem. In Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics (SLS'07), volume 4638 of Lecture Notes in Computer Science, pages 150-161, Brussels, Belgium, September 2007. Springer-Verlag GmbH. © LNCS, Springer-Verlag.

M. Blesa and C. Blum. A nature-inspired algorithm for the disjoint paths problem. In 9th International Workshop on Nature Inspired Distributed Computing (NIDISC'06), page 8 pp. (published 1 page as no. 239), Rhodes Island, Greece, April 2006. IEEE Computer Society Press. In conjunction with The 20th IEEE/ACM International Parallel and Distributed Processing (IPDPS). copyright IEEE. CD-ROM INSPEC Accession Number:8969613.

M. Blesa. Deciding stability in packet-switched FIFO networks under the Adversarial Queuing model in polynomial time. In 19th International Symposium on Distributed Computing (DISC'05), volume 3724 of Lecture Notes in Computer Science, pages 429-441, Kraków, Poland, September 2005. Springer-Verlag GmbH. © LNCS, Springer-Verlag.

M. Blesa, D. Calzada, A. Fernández, L. López, A.L. Martínez, A. Santos, and M. Serna. Adversarial queueing model for continuous network dynamics. In 30th International Symposium on Mathematical Foundations of Computer Science (MFCS'05), volume 3618 of Lecture Notes in Computer Science, pages 144-155, Gdansk, Poland, August 2005. Springer-Verlag GmbH. © LNCS, Springer-Verlag.

C. Blum and M. Blesa. Combining Ant Colony Optimization with Dynamic Programming for solving the k-cardinality tree problem. In 8th International Work-Conference on Artificial Neural Networks, Computational Intelligence and Bioinspired Systems (IWANN'05), volume 3512 of Lecture Notes in Computer Science, pages 25-33, Barcelona, Spain, June 2005. Springer-Verlag GmbH. © LNCS, Springer-Verlag.

C. Blum, M. Blesa, and A. Roli. Combining ILS with an effective constructive heuristic for the application to error correcting code design. In 6th Metaheuristics International Conference (MIC'05), pages 114-119, Wien, Austria, 2005.

A. Roli, M. Blesa, and C. Blum. Random walk and parallelism in local search. In 6th Metaheuristics International Conference (MIC'05), pages 811-816, Wien, Austria, 2005.

M. Blesa. On the use of topology extensions for provoking instability in communication network. In Information Society , subconference on Theoretical Conputer Science (IS04-TCS), pages 197-199, Ljubljana, Slovenia, October 2004. Slovenian ACM Chapter.

M. Blesa and C. Blum. Ant colony optimization for the maximum edge-disjoint paths problem. In 1st European Workshop on Evolutionary Computation in Communications, Networks, and Connected Systems (EvoCOMNET'04), in Applications of Evolutionary Computing (EvoWorkshops'04), volume 3005 of Lecture Notes in Computer Science, pages 160-169, Coimbra, Portugal, April 2004. Springer-Verlag GmbH. © LNCS, Springer-Verlag.

M. Blesa and F. Xhafa. Using parallelism in experimenting and fine tuning of parameters for metaheuristics. In 4th International Conference on Computational Science (ICCS'04), volume 3036 of Lecture Notes in Computer Science, pages 429-432, Kraków, Poland, June 2004. Springer-Verlag GmbH. © LNCS, Springer-Verlag.

C. àlvarez, M. Blesa, and M. Serna. The impact of failure management on the stability of communication networks. In 10th International Conference on Parallel and Distributed Systems (ICPADS'04), pages 153-160, Newport Beach, California, USA, July 2004. IEEE Computer Society Press. © IEEE.

C. Àlvarez, M. Blesa, J. Diaz, A. Fernández, and M. Serna. Adversarial models for priority-based networks. In 28th International Symposium on Mathematical Foundations of Computer Science (MFCS'03), volume 2747 of Lecture Notes in Computer Science, pages 142-151, Bratislava, Slovakia, August 2003. Springer-Verlag GmbH. © LNCS, Springer-Verlag.

E. Alba, F. Almeida, M. Blesa, J. Cabeza, C. Cotta, M. Diaz, I. Dorta, J. Gabarró, C. León, J. Luna, L. Moreno, C. Pablos, J. Petit, A. Rojas, and F. Xhafa. MALLBA: A library of skeletons for combinatorial optimisation. In Euro-Par 2002. Parallel Processing : 8th International Euro-Par Conference, volume 2400 of Lecture Notes in Computer Science, pages 927-932, Paderborn, Germany, August 2002. Springer-Verlag GmbH. © LNCS, Springer-Verlag.

C. Àlvarez, M. Blesa, and M. Serna. Universal stability of undirected graphs in the adversarial queueing model. In 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA'02), pages 183-197, Winnipeg, Canada, August 2002. ACM Press New York, NY, USA. © ACM.

M.J. Blesa, Ll. Hernàndez, and F. Xhafa. Parallel Skeletons for Tabu Search Method Based on Search Strategies and Neighborhood Partition. In 4th International Conference on Parallel Processing and Applied Mathematics (PPAM'01), volume 2328 of Lecture Notes in Computer Science, pages 185-193, Naleczow, Poland, September 2002. Springer-Verlag GmbH. © LNCS, Springer-Verlag.

E. Alba, F. Almeida, M. Blesa, C. Cotta, M. Diaz, I. Dorta, J. Gabarró, J. González, C. León, L. Moreno, J. Petit, J. Roda, A. Rojas, and F. Xhafa. Mallba: Towards a combinatorial optimization library for geographically distributed systems. In XII Jornadas de Paralelismo, pages 105-110, Valencia, Spain, 2001. Editorial Universitat Politècnica de València. Ref. 2001.2371, Legal Dep. V-3152-2001, ISBN 84-9705-043-6.

M.J. Blesa and F. Xhafa. A Skeleton for the Tabu Search Metaheuristic with Applications to Problems in Software Engineering. In Software Engineering using Metaheuristic INnovative ALgorithms. Proceedings of the 23rd International Conference on Software Engineering (ICSE-SEMINAL'01), pages 23-31, Toronto, Canada, 2001. IEEE Computer Society Press. ACM SIGSOFT, Software Engineering Notes, 26(6):62-66. November, 2001. © IEEE.

M.J. Blesa, Ll. Hernàndez, and F. Xhafa. Parallel Skeletons for Tabu Search Method. In 8th International Conference on Parallel and Distributed Systems (ICPADS'01), pages 23-28, Kyongju City, Korea, 2001. IEEE Computer Society Press. © IEEE.

M.J. Blesa, Ll. Hernàndez, and F. Xhafa. Tabu search for 0-1 multidimensional knapsack revisited: choosing internal heuristics and fine tuning of parameters. 12th Young Operational Research Conference, March 2001. Nottingham, UK.

M.J. Blesa, P. Moscato, and F. Xhafa. A Memetic Algorithm for the Minimum Weighted k-Cardinality Tree Subgraph Problem. In 4th Metaheuristics International Conference (MIC'01), volume 1, pages 85-90, Porto, Portugal, 2001.

M.J. Blesa and F. Xhafa. A C++ Implementation of Tabu Search for k-Cardinality Tree Problem based on Generic Programming and Component Reuse. In Net.ObjectDays 2000 Tagungsband, pages 648-652, Erfurt, Germany, 2000. Net.ObjectDays-Forum.

M.J. Blesa and C. Blum. Finding edge-disjoint paths with artificial ant colonies. Research Report LSI-05-15-R, Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, 2005. (Version with appendix of the paper with the same title).

M.J. Blesa, D. Calzada, A. Fernández, L. López, A.L. Martínez, A. Santos, and M.J. Serna. Adversarial queueing model for continuous network dynamics. Research Report LSI-05-10-R, Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, 2005. (Extended version of the paper at MFCS'05).

M.J. Blesa. A note on the use of topology extensions for provoking instability in communication networks. Research Report LSI-04-16-R, Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, 2004. (Extended version of the paper at IS04-TCS).

C. àlvarez, M. Blesa, J. Diaz, A. Fernández, and M. Serna. Adversarial models for prority-based networks. Research Report LSI-03-25-R, Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, 2003. (Extended version of the paper at MFCS'03).

M.J. Blesa and F. Xhafa. A C++ Implementation of a Skeleton for Tabu Search Method. Research Report LSI-00-47-R, Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, 2000.

M.J. Blesa, Ll. Hernàndez, and F. Xhafa. Parallel Skeletons for Tabu Search Method. Research Report LSI-00-81-R, Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, 2000. (Extended version of the paper at ICPADS'01).

M. Blesa. Stability in Communication Networks under Adversarial Models. PhD dissertation, Universitat Politècnica de Catalunya, February 2006.

M.J. Blesa. Global Computation: Problems and Algorithms. Diploma d'Estudis Avançats (DEA), 2002.

M.J. Blesa. Estudi experimental de l'algorisme dels filòsofs de Rabin. Una implementació en Java. Master thesis for the degree of superior engineer in computer science, Facultat d'Informàtica de Barcelona, Universitat Politècnica de Catalunya, 2000. (in Catalan).