University of the Basque Country
List of publications from the DBLP Bibliography Server - FAQother persons with the same name:
| 2013 | ||
|---|---|---|
| j36 | Pedro J. Copado-Méndez, Christian Blum, Gonzalo Guillén-Gosálbez, Laureano Jiménez: Large neighbourhood search applied to the efficient solution of spatially explicit strategic supply chain management problems. Computers & Chemical Engineering 49: 114-126 (2013) | |
| j35 | Francisco J. Rodríguez, Manuel Lozano, Christian Blum, Carlos García-Martínez: An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem. Computers & OR 40(7): 1829-1841 (2013) | |
| e14 | Martin Middendorf, Christian Blum (Eds.): Evolutionary Computation in Combinatorial Optimization - 13th European Conference, EvoCOP 2013, Vienna, Austria, April 3-5, 2013. Proceedings. Lecture Notes in Computer Science 7832, Springer 2013, isbn 978-3-642-37197-4 | |
| 2012 | ||
| j34 | Francisco J. Rodríguez, Christian Blum, Carlos García-Martínez, Manuel Lozano: GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times. Annals OR 201(1): 383-401 (2012) | |
| j33 | Salim Bouamama, Christian Blum, Abdellah Boukerram: A population-based iterated greedy algorithm for the minimum weight vertex cover problem. Appl. Soft Comput. 12(6): 1632-1639 (2012) | |
| j32 | Hugo Hernández, Christian Blum: Distributed ant colony optimization for minimum energy broadcasting in sensor networks with realistic antennas. Computers & Mathematics with Applications 64(12): 3683-3700 (2012) | |
| j31 | Andrea Roli, Stefano Benedettini, Thomas Stützle, Christian Blum: Large neighbourhood search algorithms for the founder sequence reconstruction problem. Computers & OR 39(2): 213-224 (2012) | |
| j30 | Vera C. Hemmelmayr, Verena Schmid, Christian Blum: Variable neighbourhood search for the variable sized bin packing problem. Computers & OR 39(5): 1097-1108 (2012) | |
| j29 | Hugo Hernández, Christian Blum: Distributed graph coloring: an approach based on the calling behavior of Japanese tree frogs. Swarm Intelligence 6(2): 117-150 (2012) | |
| p4 | Christian Blum, Raymond Chiong, Maurice Clerc, Kenneth A. De Jong, Zbigniew Michalewicz, Ferrante Neri, Thomas Weise: Evolutionary Optimization. Variants of Evolutionary Algorithms for Real-World Applications 2012: 1-29 | |
| c46 | Sergi Mateo, Christian Blum, Pascal Fua, Engin Türetken: Hybrid Algorithms for the Minimum-Weight Rooted Arborescence Problem. ANTS 2012: 61-72 | |
| c45 | Francisco J. Rodríguez, Christian Blum, Manuel Lozano, Carlos García-Martínez: Iterated Greedy Algorithms for the Maximal Covering Location Problem. EvoCOP 2012: 172-181 | |
| c44 | Francisco J. Rodríguez, Carlos García-Martínez, Christian Blum, Manuel Lozano: An Artificial Bee Colony Algorithm for the Unrelated Parallel Machines Scheduling Problem. PPSN (2) 2012: 143-152 | |
| c43 | ||
| e13 | Marco Dorigo, Mauro Birattari, Christian Blum, Anders Lyhne Christensen, Andries Petrus Engelbrecht, Roderich Groß, Thomas Stützle (Eds.): Swarm Intelligence - 8th International Conference, ANTS 2012, Brussels, Belgium, September 12-14, 2012. Proceedings. Lecture Notes in Computer Science 7461, Springer 2012, isbn 978-3-642-32649-3 | |
| i4 | Christian Blum, Verena Schmid, Lukas Baumgartner: On Solving the Oriented . CoRR abs/1209.0880 (2012) | |
| 2011 | ||
| j28 | Christian Blum, Roberto Battiti: Guest editorial: Special issue based on the LION 4 conference. Ann. Math. Artif. Intell. 61(2): 47-48 (2011) | |
| j27 | Christian Blum, Jakob Puchinger, Günther R. Raidl, Andrea Roli: Hybrid metaheuristics in combinatorial optimization: A survey. Appl. Soft Comput. 11(6): 4135-4151 (2011) | |
| j26 | Hugo Hernández, Christian Blum: Minimum energy broadcasting in wireless sensor networks: An ant colony optimization approach for a realistic antenna model. Appl. Soft Comput. 11(8): 5684-5694 (2011) | |
| j25 | Hugo Hernández, Christian Blum: Foundations of Antcycle: Self-synchronized Duty-cycling in Mobile Sensor Networks. Comput. J. 54(9): 1427-1448 (2011) | |
| j24 | Christian Blum, Cristóbal Miralles: On solving the assembly line worker assignment and balancing problem via beam search. Computers & OR 38(1): 328-339 (2011) | |
| j23 | Engin Türetken, Germán González, Christian Blum, Pascal Fua: Automated Reconstruction of Dendritic and Axonal Trees by Global Optimization with Geometric Priors. Neuroinformatics 9(2-3): 279-302 (2011) | |
| c42 | Hugo Hernández, Christian Blum: Implementing a model of Japanese tree frogs' calling behavior in sensor networks: a study of possible improvements. GECCO (Companion) 2011: 615-622 | |
| c41 | ||
| c40 | Lukas Baumgartner, Verena Schmid, Christian Blum: Solving the Two-Dimensional Bin Packing Problem with a Probabilistic Multi-start Heuristic. LION 2011: 76-90 | |
| c39 | James Hereford, Christian Blum: FlockOpt: A new swarm optimization algorithm based on collective behavior of starling birds. NaBIC 2011: 17-22 | |
| 2010 | ||
| j22 | ||
| j21 | Manuel López-Ibáñez, Christian Blum: Beam-ACO for the travelling salesman problem with time windows. Computers & OR 37(9): 1570-1583 (2010) | |
| j20 | Monaldo Mastrolilli, Christian Blum: On the use of different types of knowledge in metaheuristics based on constructing solutions. Eng. Appl. of AI 23(5): 650-659 (2010) | |
| c38 | Christian Blum: Beam-ACO for the longest common subsequence problem. IEEE Congress on Evolutionary Computation 2010: 1-8 | |
| c37 | Manuel Lozano, Christian Blum: A Hybrid Metaheuristic for the Longest Common Subsequence Problem. Hybrid Metaheuristics 2010: 1-15 | |
| c36 | Christian Blum, Vera C. Hemmelmayr, Hugo Hernández, Verena Schmid: Hybrid Algorithms for the Variable Sized Bin Packing Problem. Hybrid Metaheuristics 2010: 16-30 | |
| c35 | Stefano Benedettini, Christian Blum, Andrea Roli: A Randomized Iterated Greedy Algorithm for the Founder Sequence Reconstruction Problem. LION 2010: 37-51 | |
| c34 | Engin Türetken, Christian Blum, Germán González, Pascal Fua: Reconstructing Geometrically Consistent Tree Structures from Noisy Images. MICCAI (1) 2010: 291-299 | |
| c33 | Hugo Hernández, Maria J. Blesa, Christian Blum, Tobias Baumgartner, Sándor P. Fekete, Alexander Kröller: A Protocol for Self-Synchronized Duty-Cycling in Sensor Networks: Generic Implementation in Wiselib. MSN 2010: 134-139 | |
| e12 | Maria J. Blesa, Christian Blum, Günther R. Raidl, Andrea Roli, Michael Sampels (Eds.): Hybrid Metaheuristics - 7th International Workshop, HM 2010, Vienna, Austria, October 1-2, 2010. Proceedings. Lecture Notes in Computer Science 6373, Springer 2010, isbn 978-3-642-16053-0 | |
| e11 | Christian Blum, Roberto Battiti (Eds.): Learning and Intelligent Optimization, 4th International Conference, LION 4, Venice, Italy, January 18-22, 2010. Selected Papers. Lecture Notes in Computer Science 6073, Springer 2010, isbn 978-3-642-13799-0 | |
| i3 | Hugo Hernández, Tobias Baumgartner, Maria J. Blesa, Christian Blum, Alexander Kröller, Sándor P. Fekete: A Protocol for Self-Synchronized Duty-Cycling in Sensor Networks: Generic Implementation in Wiselib. CoRR abs/1010.4385 (2010) | |
| i2 | Hugo Hernández, Christian Blum: Distributed Graph Coloring: An Approach Based on the Calling Behavior of Japanese Tree Frogs. CoRR abs/1011.5349 (2010) | |
| i1 | Christian Blum: Iterative Beam Search for Simple Assembly Line Balancing with a Fixed Number of Work Stations. CoRR abs/1012.3273 (2010) | |
| 2009 | ||
| j19 | Christian Blum, Maria J. Blesa, Manuel López-Ibáñez: Beam search for the longest common subsequence problem. Computers & OR 36(12): 3178-3186 (2009) | |
| j18 | ||
| j17 | Hugo Hernández, Christian Blum: Ant colony optimization for multicasting in static wireless ad-hoc networks. Swarm Intelligence 3(2): 125-148 (2009) | |
| c32 | Manuel López-Ibáñez, Christian Blum, Dhananjay R. Thiruvady, Andreas T. Ernst, Bernd Meyer: Beam-ACO Based on Stochastic Sampling for Makespan Optimization Concerning the TSP with Time Windows. EvoCOP 2009: 97-108 | |
| c31 | Hugo Hernández, Christian Blum: Self-synchronized duty-cycling in sensor networks with energy harvesting capabilities: the static network case. GECCO 2009: 33-40 | |
| c30 | ||
| c29 | Dhananjay R. Thiruvady, Christian Blum, Bernd Meyer, Andreas T. Ernst: Hybridizing Beam-ACO with Constraint Programming for Single Machine Job Scheduling. Hybrid Metaheuristics 2009: 30-44 | |
| c28 | Andrea Roli, Christian Blum: Tabu Search for the Founder Sequence Reconstruction Problem: A Preliminary Study. IWANN (2) 2009: 1035-1042 | |
| c27 | Manuel López-Ibáñez, Christian Blum: Beam-ACO Based on Stochastic Sampling: A Case Study on the TSP with Time Windows. LION 2009: 59-73 | |
| e10 | Maria J. Blesa, Christian Blum, Luca Di Gaspero, Andrea Roli, Michael Sampels, Andrea Schaerf (Eds.): Hybrid Metaheuristics, 6th International Workshop, HM 2009, Udine, Italy, October 16-17, 2009. Proceedings. Lecture Notes in Computer Science 5818, Springer 2009, isbn 978-3-642-04917-0 | |
| 2008 | ||
| e9 | Christian Blum, Daniel Merkle (Eds.): Swarm Intelligence: Introduction and Applications. Natural Computing Series, Springer 2008, isbn 978-3-540-74088-9 | |
| e8 | Christian Blum, María J. Blesa Aguilera, Andrea Roli, Michael Sampels (Eds.): Hybrid Metaheuristics, An Emerging Approach to Optimization. Studies in Computational Intelligence 114, Springer 2008, isbn 978-3-540-78294-0 | |
| j16 | Christian Blum, Mateu Yábar Vallès, Maria J. Blesa: An ant colony optimization algorithm for DNA sequencing by hybridization. Computers & OR 35(11): 3620-3635 (2008) | |
| j15 | Christian Blum: Beam-ACO for Simple Assembly Line Balancing. INFORMS Journal on Computing 20(4): 618-627 (2008) | |
| c26 | Hugo Hernández, Christian Blum, Guillem Francès: Ant Colony Optimization for Energy-Efficient Broadcasting in Ad-Hoc Networks. ANTS Conference 2008: 25-36 | |
| c25 | Alexander Scheidler, Christian Blum, Daniel Merkle, Martin Middendorf: Emergent Sorting in Networks of Router Agents. ANTS Conference 2008: 299-306 | |
| c24 | Christian Blum, Joaquín Bautista, Jordi Pereira: An Extended Beam-ACO Approach to the Time and Space Constrained Simple Assembly Line Balancing Problem. EvoCOP 2008: 85-96 | |
| p3 | ||
| p2 | Christian Blum, Andrea Roli: Hybrid Metaheuristics: An Introduction. Hybrid Metaheuristics 2008: 1-30 | |
| p1 | Christian Blum, Carlos Cotta, Antonio J. Fernández, José E. Gallardo, Monaldo Mastrolilli: Hybridizations of Metaheuristics With Branch & Bound Derivates. Hybrid Metaheuristics 2008: 85-116 | |
| e7 | Marco Dorigo, Mauro Birattari, Christian Blum, Maurice Clerc, Thomas Stützle, Alan F. T. Winfield (Eds.): Ant Colony Optimization and Swarm Intelligence, 6th International Conference, ANTS 2008, Brussels, Belgium, September 22-24, 2008. Proceedings. Lecture Notes in Computer Science 5217, Springer 2008, isbn 978-3-540-87526-0 | |
| e6 | Maria J. Blesa, Christian Blum, Carlos Cotta, Antonio J. Fernández, José E. Gallardo, Andrea Roli, Michael Sampels (Eds.): Hybrid Metaheuristics, 5th International Workshop, HM 2008, Málaga, Spain, October 8-9, 2008. Proceedings. Lecture Notes in Computer Science 5296, Springer 2008, isbn 978-3-540-88438-5 | |
| 2007 | ||
| j14 | Christian Blum: Revisiting dynamic programming for finding optimal subtrees in trees. European Journal of Operational Research 177(1): 102-115 (2007) | |
| j13 | Maria J. Blesa, Christian Blum: Finding Edge-disjoint Paths in Networks: An Ant Colony Optimization Algorithm. J. Math. Model. Algorithms 6(3): 361-391 (2007) | |
| j12 | Krzysztof Socha, Christian Blum: An ant colony optimization algorithm for continuous optimization: application to feed-forward neural network training. Neural Computing and Applications 16(3): 235-247 (2007) | |
| c23 | Christian Blum, Carlos Cotta, Antonio J. Fernández, José E. Gallardo: A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem. EvoCOP 2007: 36-47 | |
| c22 | Francisco Luna, Christian Blum, Enrique Alba, Antonio J. Nebro: ACO vs EAs for solving a real-world frequency assignment problem in GSM networks. GECCO 2007: 94-101 | |
| c21 | ||
| c20 | Christian Blum, Monaldo Mastrolilli: Using Branch & Bound Concepts in Construction-Based Metaheuristics: Exploiting the Dual Problem Knowledge. Hybrid Metaheuristics 2007: 123-139 | |
| c19 | Christian Blum, Maria J. Blesa: Probabilistic Beam Search for the Longest Common Subsequence Problem. SLS 2007: 150-161 | |
| e5 | Thomas Bartz-Beielstein, María J. Blesa Aguilera, Christian Blum, Boris Naujoks, Andrea Roli, Günter Rudolph, Michael Sampels (Eds.): Hybrid Metaheuristics, 4th International Workshop, HM 2007, Dortmund, Germany, October 8-9, 2007, Proceedings. Lecture Notes in Computer Science 4771, Springer 2007, isbn 978-3-540-75513-5 | |
| 2006 | ||
| j11 | Christian Blum, Andrea Roli, Michael Sampels: Editorial. J. Math. Model. Algorithms 5(1): 1-3 (2006) | |
| c18 | Christian Blum, Joaquín Bautista, Jordi Pereira: Beam-ACO Applied to Assembly Line Balancing. ANTS Workshop 2006: 96-107 | |
| c17 | Christian Blum: A new hybrid evolutionary algorithm for the huge k-cardinality tree problem. GECCO 2006: 515-522 | |
| c16 | Christian Blum, Mateu Yábar Vallès: Multi-level Ant Colony Optimization for DNA Sequencing by Hybridization. Hybrid Metaheuristics 2006: 94-109 | |
| c15 | Maria J. Blesa, Christian Blum: A nature-inspired algorithm for the disjoint paths problem. IPDPS 2006 | |
| c14 | Christian Blum, Mateu Yábar Vallès: New Constructive Heuristics for DNA Sequencing by Hybridization. WABI 2006: 355-365 | |
| e4 | Francisco Almeida, María J. Blesa Aguilera, Christian Blum, J. Marcos Moreno-Vega, Melquíades Pérez Pérez, Andrea Roli, Michael Sampels (Eds.): Hybrid Metaheuristics, Third International Workshop, HM 2006, Gran Canaria, Spain, October 13-15, 2006, Proceedings. Lecture Notes in Computer Science 4030, Springer 2006, isbn 3-540-46384-4 | |
| 2005 | ||
| j10 | Christian Blum: M. Dorigo and T. Stützle, Ant Colony Optimization. Artif. Intell. 165(2): 261-264 (2005) | |
| j9 | Christian Blum, Maria J. Blesa: New metaheuristic approaches for the edge-weighted k-cardinality tree problem. Computers & OR 32: 1355-1377 (2005) | |
| j8 | Christian Blum: Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling. Computers & OR 32: 1565-1591 (2005) | |
| j7 | Daniel Merkle, Christian Blum: Swarm Intelligence - An Optimization-Based Introduction. KI 19(4): 5-10 (2005) | |
| j6 | Marco Dorigo, Christian Blum: Ant colony optimization theory: A survey. Theor. Comput. Sci. 344(2-3): 243-278 (2005) | |
| j5 | Christian Blum, Marco Dorigo: Search bias in ant colony optimization: on the role of competition-balanced systems. IEEE Trans. Evolutionary Computation 9(2): 159-174 (2005) | |
| c13 | Christian Blum, Krzysztof Socha: Training feed-forward neural networks with ant colony optimization: An application to pattern classification. HIS 2005: 233-238 | |
| c12 | Christian Blum, Maria J. Blesa: Combining Ant Colony Optimization with Dynamic Programming for Solving the k-Cardinality Tree Problem. IWANN 2005: 25-33 | |
| e3 | Maria J. Blesa, Christian Blum, Andrea Roli, Michael Sampels (Eds.): Hybrid Metaheuristics, Second International Workshop, HM 2005, Barcelona, Spain, August 29-30, 2005, Proceedings. Lecture Notes in Computer Science 3636, Springer 2005, isbn 3-540-28535-0 | |
| 2004 | ||
| b1 | Christian Blum: Theoretical and practical aspects of ant colony optimization. Brussels, Univ. 2004, isbn 3-89838-282-6, pp. 1-280 | |
| j4 | Christian Blum, Michael Sampels: An Ant Colony Optimization Algorithm for Shop Scheduling Problems. J. Math. Model. Algorithms 3(3): 285-308 (2004) | |
| j3 | Christian Blum, Marco Dorigo: The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man, and Cybernetics, Part B 34(2): 1161-1172 (2004) | |
| c11 | ||
| c10 | Maria J. Blesa, Christian Blum: Ant Colony Optimization for the Maximum Edge-Disjoint Paths Problem. EvoWorkshops 2004: 160-169 | |
| e2 | Marco Dorigo, Mauro Birattari, Christian Blum, Luca Maria Gambardella, Francesco Mondada, Thomas Stützle (Eds.): Ant Colony Optimization and Swarm Intelligence, 4th International Workshop, ANTS 2004, Brussels, Belgium, September 5 - 8, 2004, Proceedings. Lecture Notes in Computer Science 3172, Springer 2004, isbn 3-540-22672-9 | |
| e1 | Christian Blum, Andrea Roli, Michael Sampels (Eds.): Hybrid Metaheuristics, First International Workshop, HM 2004, Valencia, Spain, August 22-23, 2004, Proceedings. 2004, isbn 3-00-015331-4 | |
| 2003 | ||
| j2 | Christian Blum, Andrea Roli: Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Comput. Surv. 35(3): 268-308 (2003) | |
| j1 | Christian Blum, Matthias Ehrgott: Local Search Algorithms for the k-cardinality Tree Problem. Discrete Applied Mathematics 128(2-3): 511-540 (2003) | |
| 2002 | ||
| c9 | Christian Blum: ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversification. Ant Algorithms 2002: 14-27 | |
| c8 | Christian Blum: Ant Colony Optimization For The Edge-weighted k-cardinality Tree Problem. GECCO 2002: 27-34 | |
| c7 | Christian Blum, Michael Sampels, Mark Zlochin: On A Particularity In Model-based Search. GECCO 2002: 35-42 | |
| c6 | Michael Sampels, Christian Blum, Monaldo Mastrolilli, Olivia Rossi-Doria: Metaheuristics for Group Shop Scheduling. PPSN 2002: 631-640 | |
| c5 | Christian Blum, Michael Sampels: When Model Bias Is Stronger than Selection Pressure. PPSN 2002: 893-902 | |
| 2001 | ||
| c4 | Andrea Roli, Christian Blum: Critical Parallelization of Local Search for MAX-SAT. AI*IA 2001: 147-158 | |
| 1997 | ||
| c3 | Jürgen Rahmel, Christian Blum, Peter Hahn, Björn Krapohl: Diagnosis and Monitoring of Ulnar Nerve Lesions. AIME 1997: 211-222 | |
| c2 | Jürgen Rahmel, Christian Blum, Peter Hahn: On the Role of Hierarchy for Neural Network Interpretation. IJCAI 1997: 1072-1077 | |
| c1 | Jürgen Rahmel, Christian Blum, Peter Hahn: Interpretation of a Hierarchical Neural Network. IWANN 1997: 651-659 | |
Colors in the list of coauthors
Last update Tue May 21 08:03:35 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page