Menu

Curriculum Vitae Download PDF file

In press

• Currently no article in press.

2012

• [29] V. Hemmelmayr, V. Schmid and C. Blum. Variable Neigbhourhood Search for the Variable Sized Bin Packing Problem. Computers & Operations Research, 39(5):1097--1108, 2012.

• [28] A. Roli, S. Benedettini, T. Stuetzle and C. Blum. Large Neighbourhood Search Algorithms for the Founder Sequence Reconstruction Problem. Computers & Operations Research, 39(2):213--224, 2012.

2011

• [27] C. Blum. Iterative Beam Search for Simple Assembly Line Balancing with a Fixed Number of Work Stations. Statistics and Operations Research Transactions, 35(2):145--164, 2011.

• [26] H. Hernandez and C. Blum. Minimum Energy Broadcasting in Wireless Sensor Networks: An Ant Colony Optimization Approach For a Realistic Antenna Model. Applied Soft Computing, 11(8):5684--5694, 2011.

• [25] H. Hernandez and C. Blum. Foundations of ANTCYCLE: Self-Synchronized Duty-Cycling in Mobile Sensor Networks. The Computer Journal, 54(9):1427--1448, 2011.

• [24] E. Turetgen, G. Gonzalez, C. Blum and P. Fua. Automated Reconstruction of Dendritic and Axonal Trees by Global Optimization with Geometric Priors. Neuroinformatics, 9(2-3):279--302, 2011.

• [23] C. Blum, J. Puchinger, G. Raidl and A. Roli. Hybrid Metaheuristics in Combinatorial Optimization: A Survey. Applied Soft Computing, 11(6):4135--4151, 2011.

• [22] C. Blum and C. Miralles. On solving the assembly line worker assignment and balancing problem via beam search. Computers & Operations Research, 38(1):328--339, 2011.

2010

• [21] M. Mastrolilli and C. Blum. On the use of different types of knowledge in metaheuristics based on constructing solutions. Engineering Applications of Artificial Intelligence, 23(5):650--659, 2010.

• [20] M. Lopez and C. Blum. Beam-ACO for the travelling salesman problem with time windows. Computers & Operations Research, 37(9):1570--1583, 2010.

2009

• [19] H. Hernandez and C. Blum. Ant Colony Optimization for Multicasting in Wireless Ad Hoc Networks. Swarm Intelligence, 3(2):125--148, 2009.

• [18] C. Blum, M. J. Blesa, and M. Lopez. Beam Search for the Longest Common Subsequence Problem. Computers & Operations Research, 36(12):3178--3186, 2009.

2008

• [17] C. Blum. Beam-ACO for simple assembly line balancing. INFORMS Journal on Computing, 20(4):618--627, 2008.

• [16] C. Blum, M. Yabar, and M. J. Blesa. An ant colony optimization algorithm for DNA sequencing by hybridization. Computers & Operations Research, 35, 3620-3635, 2008.

2007

• [15] M.J. Blesa and C. Blum. Finding edge-dijoint paths in networks be means of artificial ant colonies. Journal of Mathematical Modelling and Algorithms, 6(3):361-391, 2007.

• [14] K. Socha, and C. Blum. An ant colony optimization algorithm for continuous optimization: An application to feed-forward neural network training. Neural Computing & Applications, 16(3):235-248, 2007.

• [13] C. Blum. Revisiting dynamic programming for finding optimal subtrees in trees. European Journal of Operational Research, 177(1):102-115, 2007.

• [12] C. Blum. Iterated local search and constructive heuristics for error correcting code design. International Journal of Innovative Computing and Applications, 1(1):14-22, 2007.

2005

• [11] D. Merkle and C. Blum. Swarm Intelligence -- An optimization-based introduction. Künstliche Intelligenz, 4:5-10, 2005.

• [10] C. Blum. Beam-ACO---Hybridizing ant colony optimization with beam search: An application to open shop scheduling. Computers & Operations Research, 32(6):1565-1591, 2005.

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

• [08] C. Blum and M. Dorigo. Search bias in ant colony optimization: On the role of competition-balanced systems. IEEE Transactions on Evolutionary Computation, 9(2):159-174, 2005.

• [07] C. Blum. Ant colony optimization: Introduction and recent trends. Physics of Life Reviews, 2(4):353-373, 2005.

• [06] M. Dorigo and C. Blum. Ant colony optimization theory: A survey. Theoretical Computer Science, 344(2-3):243-278, 2005.

2004

• [05] C. Blum and M. Dorigo. The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man, and Cybernetics -- Part B, 34(2):1161-1172, 2004.

• [04] C. Blum and M. Sampels. An ant colony optimization algorithm for shop scheduling problems. Journal of Mathematical Modelling and Algorithms, 3(3):285-308, 2004.

2003

• [03] C. Blum and M. Ehrgott. Local search algorithms for the k-cardinality tree problem. Discrete Applied Mathematics, 128:511-540, 2003. Selected for the Editors' choice volume of 2003.

• [02] C. Blum and A. Roli. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys, 35(3):268-308, 2003.

1998

• [01] J. Rahmel, C. Blum, and P. Hahn. Diagnosis of finger dysfunction caused by ulnar nerve lesions. Journal of Intelligent Systems, 8(1/2), 1998.