default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristian Blum 0001
Person information
- affiliation: Artificial Intelligence Research Institute (IIIA-CSIC), Campus UAB, Bellaterra, Spain
- affiliation (former): Spanish National Research Council, CSIC, Spain
- affiliation (former): University of the Basque Country, San Sebastian, Spain
- affiliation (former): IKERBASQUE, Basque Foundation for Science, Bilbao, Spain
- affiliation (former): Technical University of Catalonia, ALBCOM, Barcelona, Spain
- affiliation (PhD 2004): Université libre de Bruxelles, Brussels, Belgium
- affiliation (former): University of Kaiserslautern, Germany
Other persons with the same name
- Christian Blum 0002 — HU Berlin, Germany
- Christian Blum 0003 — Eurecom, Sophia-Antipolis, France
- Christian Blum 0004 — Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU), Erlangen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2024
[b3]Christian Blum:
Construct, Merge, Solve & Adapt - A Hybrid Metaheuristic for Combinatorial Optimization. Springer 2024, ISBN 978-3-031-60102-6, pp. 1-179- 2016
- [b2]Christian Blum, Günther R. Raidl:
Hybrid Metaheuristics - Powerful Tools for Optimization. Artificial Intelligence: Foundations, Theory, and Algorithms, Springer 2016, ISBN 978-3-319-30882-1, pp. 1-136 - 2004
- [b1]Christian Blum:
Theoretical and practical aspects of ant colony optimization. Brussels, Univ., 2004, ISBN 3-89838-282-6, pp. 1-280
Journal Articles
- 2025
- [j90]Camilo Chacón Sartori, Christian Blum, Filippo Bistaffa, Guillem Rodríguez Corominas:
Metaheuristics and Large Language Models Join Forces: Toward an Integrated Optimization Approach. IEEE Access 13: 2058-2079 (2025) - 2024
- [j89]Nariman Nakhjiri
, Maria Salamó, Miquel Sànchez-Marrè, Christian Blum, Juan Carlos Morales:
Forgetful Swarm Optimization for Astronomical Observation Scheduling. IEEE Access 12: 171644-171661 (2024) - [j88]Mehmet Anil Akbay, Christian Blum, Can Berk Kalayci:
CMSA based on set covering models for packing and routing problems. Ann. Oper. Res. 343(1): 1-38 (2024) - [j87]Roberto Maria Rosati, Salim Bouamama, Christian Blum:
Multi-constructor CMSA for the maximum disjoint dominating sets problem. Comput. Oper. Res. 161: 106450 (2024) - [j86]Pedro Pinacho Davidson, Christian Blum, M. Angélica Pinninghoff, A. Ricardo Contreras:
Extension of CMSA with a Learning Mechanism: Application to the Far from Most String Problem. Int. J. Comput. Intell. Syst. 17(1): 109 (2024) - 2023
- [j85]Guillem Rodríguez Corominas, Maria J. Blesa, Christian Blum:
AntNetAlign: Ant Colony Optimization for Network Alignment. Appl. Soft Comput. 132: 109832 (2023) - [j84]Marko Djukanovic, Aleksandar Kartelj, Christian Blum:
Self-adaptive CMSA for solving the multidimensional multi-way number partitioning problem. Expert Syst. Appl. 232: 120762 (2023) - [j83]Guillem Rodríguez Corominas, Maria J. Blesa, Christian Blum:
AntNetAlign - A software package for Network Alignment. Softw. Impacts 15: 100476 (2023) - [j82]Camilo Chacón Sartori, Christian Blum, Gabriela Ochoa:
STNWeb: A new visualization tool for analyzing optimization algorithms. Softw. Impacts 17: 100558 (2023) - 2022
- [j81]Marko Djukanovic, Aleksandar Kartelj, Dragan Matic, Milana Grbic, Christian Blum, Günther R. Raidl:
Graph search and variable neighborhood search for finding constrained longest common subsequences in artificial and real gene sequences. Appl. Soft Comput. 122: 108844 (2022) - [j80]Christian Blum, Anton V. Eremeev, Julia V. Kovalenko:
Hybridizations of evolutionary algorithms with Large Neighborhood Search. Comput. Sci. Rev. 46: 100512 (2022) - [j79]Mehmet Anil Akbay, Albert López Serrano, Christian Blum:
A Self-Adaptive Variant of CMSA: Application to the Minimum Positive Influence Dominating Set Problem. Int. J. Comput. Intell. Syst. 15(1): 44 (2022) - [j78]Teddy Nurcahyadi, Christian Blum, Felip Manyà:
Negative Learning Ant Colony Optimization for MaxSAT. Int. J. Comput. Intell. Syst. 15(1): 71 (2022) - [j77]Christian Blum, Tome Eftimov, Peter Korosec:
Preface. Nat. Comput. 21(2): 127-130 (2022) - [j76]Salim Bouamama, Christian Blum, Pedro Pinacho Davidson:
A Population-Based Iterated Greedy Algorithm for Maximizing Sensor Network Lifetime. Sensors 22(5): 1804 (2022) - [j75]Jon Pérez, Jose Luis Flores, Christian Blum, Jesús Cerquides, Alex Abuin:
Optimization Techniques and Formal Verification for the Software Design of Boolean Algebra Based Safety-Critical Systems. IEEE Trans. Ind. Informatics 18(1): 620-630 (2022) - 2021
- [j74]Salim Bouamama, Christian Blum:
An Improved Greedy Heuristic for the Minimum Positive Influence Dominating Set Problem in Social Networks. Algorithms 14(3): 79 (2021) - [j73]Samir Balbal, Salim Bouamama, Christian Blum:
A Greedy Heuristic for Maximizing the Lifetime of Wireless Sensor Networks Based on Disjoint Weighted Dominating Sets. Algorithms 14(6): 170 (2021) - [j72]Gabriela Ochoa, Katherine M. Malan, Christian Blum:
Search trajectory networks: A tool for analysing and visualising the behaviour of metaheuristics. Appl. Soft Comput. 109: 107492 (2021) - [j71]Christian Blum, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu-Min Li, Felip Manyà, Günther R. Raidl:
Solving longest common subsequence problems via a transformation to the maximum clique problem. Comput. Oper. Res. 125: 105089 (2021) - [j70]Christian Blum, Gabriela Ochoa:
A comparative analysis of two matheuristics by means of merged local optima networks. Eur. J. Oper. Res. 290(1): 36-56 (2021) - [j69]Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum:
An A⁎ search algorithm for the constrained longest common subsequence problem. Inf. Process. Lett. 166: 106041 (2021) - [j68]Christian Blum, Tome Eftimov, Peter Korosec:
Preface. Nat. Comput. 20(3): 341-344 (2021) - [j67]Marco Dorigo, Thomas Stützle, Maria J. Blesa, Christian Blum, Heiko Hamann, Mary Katherine Heinrich:
ANTS 2020 Special Issue: Editorial. Swarm Intell. 15(4): 311-313 (2021) - [j66]Filippo Bistaffa, Christian Blum, Jesús Cerquides, Alessandro Farinelli, Juan A. Rodríguez-Aguilar:
A Computational Approach to Quantify the Benefits of Ridesharing for Policy Makers and Travellers. IEEE Trans. Intell. Transp. Syst. 22(1): 119-130 (2021) - 2020
- [j65]Dhananjay R. Thiruvady, Christian Blum, Andreas T. Ernst:
Solution Merging in Matheuristics for Resource Constrained Job Scheduling. Algorithms 13(10): 256 (2020) - [j64]Marko Djukanovic, Günther R. Raidl, Christian Blum:
Finding Longest Common Subsequences: New anytime A∗ search results. Appl. Soft Comput. 95: 106499 (2020) - [j63]Marko Djukanovic, Günther R. Raidl, Christian Blum:
Anytime algorithms for the longest common palindromic subsequence problem. Comput. Oper. Res. 114 (2020) - [j62]Christian Blum:
Minimum common string partition: on solving large-scale problem instances. Int. Trans. Oper. Res. 27(1): 91-111 (2020) - 2019
- [j61]Matthias Horn, Günther R. Raidl, Christian Blum:
Job sequencing with one common and multiple secondary resources: An A⁎/Beam Search based anytime algorithm. Artif. Intell. 277 (2019) - [j60]Salim Bouamama, Christian Blum, Jean-Guillaume Fages:
An algorithm based on ant colony optimization for the minimum connected dominating set problem. Appl. Soft Comput. 80: 672-686 (2019) - [j59]Ewa Andrejczuk, Filippo Bistaffa, Christian Blum, Juan A. Rodríguez-Aguilar, Carles Sierra:
Synergistic team composition: A computational approach to foster diversity in teams. Knowl. Based Syst. 182 (2019) - [j58]Marco Dorigo, Mauro Birattari, Christian Blum, Anders Lyhne Christensen, Andreagiovanni Reina, Vito Trianni:
ANTS 2018 special issue: Editorial. Swarm Intell. 13(3-4): 169-172 (2019) - 2018
- [j57]Christian Blum, Maria J. Blesa:
Hybrid techniques based on solving reduced problem instances for a longest common subsequence problem. Appl. Soft Comput. 62: 15-28 (2018) - [j56]Christian Blum:
ILP-Based Reduced Variable Neighborhood Search for Large-Scale Minimum Common String Partition. Electron. Notes Discret. Math. 66: 15-22 (2018) - [j55]Pedro Pinacho Davidson, Christian Blum, José Antonio Lozano:
The weighted independent domination problem: Integer linear programming models and metaheuristic approaches. Eur. J. Oper. Res. 265(3): 860-871 (2018) - [j54]Christian Blum, Maria J. Blesa:
A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem. J. Heuristics 24(3): 551-579 (2018) - 2017
- [j53]Christian Blum, Angel A. Juan, Helena Ramalhinho Dias Lourenço, Thomas Stützle:
Special issue on "Metaheuristics". Int. Trans. Oper. Res. 24(3): 681-682 (2017) - [j52]Christian Blum, Angel A. Juan, Helena R. Lourenço, Thomas Stützle:
Special issue on "Metaheuristics". Int. Trans. Oper. Res. 24(4): 925-926 (2017) - [j51]Christian Blum, Angel A. Juan, Helena R. Lourenço, Thomas Stützle:
Special issue on "Metaheuristics". Int. Trans. Oper. Res. 24(6): 1587-1588 (2017) - [j50]David Chalupa, Christian Blum:
Mining k-reachable sets in real-world networks using domination in shortcut graphs. J. Comput. Sci. 22: 1-14 (2017) - [j49]Evelia Lizárraga, Maria J. Blesa, Christian Blum, Günther R. Raidl:
Large neighborhood search for the most strings with few bad columns problem. Soft Comput. 21(17): 4901-4915 (2017) - 2016
- [j48]Christian Blum, Pedro Pinacho Davidson, Manuel López-Ibáñez, José Antonio Lozano:
Construct, Merge, Solve & Adapt A new general algorithm for combinatorial optimization. Comput. Oper. Res. 68: 75-88 (2016) - [j47]Francisco Chicano, Christian Blum, Gabriela Ochoa:
Editorial for the Special Issue on Combinatorial Optimization Problems. Evol. Comput. 24(4): 573-575 (2016) - [j46]Christian Blum, Günther R. Raidl:
Computational performance evaluation of two integer linear programming models for the minimum common string partition problem. Optim. Lett. 10(1): 189-205 (2016) - [j45]Salim Bouamama, Christian Blum:
A hybrid algorithmic model for the minimum weight dominating set problem. Simul. Model. Pract. Theory 64: 57-68 (2016) - 2015
- [j44]Christian Blum, José Antonio Lozano, Pedro Pinacho Davidson:
An Artificial Bioindicator System for Network Intrusion Detection. Artif. Life 21(2): 93-118 (2015) - [j43]Carlos García-Martínez, Christian Blum, Francisco J. Rodríguez, Manuel Lozano:
The firefighter problem: Empirical results on random graphs. Comput. Oper. Res. 60: 55-66 (2015) - [j42]Christian Blum, José Antonio Lozano, Pedro Pinacho Davidson:
Mathematical programming strategies for solving the minimum common string partition problem. Eur. J. Oper. Res. 242(3): 769-777 (2015) - [j41]Christian Blum, Borja Calvo:
A matheuristic for the minimum weight rooted arborescence problem. J. Heuristics 21(4): 479-499 (2015) - [j40]Christian Blum, Borja Calvo, Maria J. Blesa:
FrogCOL and FrogMIS: new decentralized algorithms for finding large independent sets in graphs. Swarm Intell. 9(2-3): 205-227 (2015) - 2014
- [j39]Hugo Hernández, Christian Blum:
FrogSim: distributed graph coloring in wireless ad hoc networks - An algorithm inspired by the calling behavior of Japanese tree frogs. Telecommun. Syst. 55(2): 211-223 (2014) - 2013
- [j38]Manuel López-Ibáñez, Christian Blum, Jeffrey W. Ohlmann, Barrett W. Thomas:
The travelling salesman problem with time windows: Adapting algorithms from travel-time to makespan optimization. Appl. Soft Comput. 13(9): 3806-3815 (2013) - [j37]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. Comput. Chem. Eng. 49: 114-126 (2013) - [j36]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. Comput. Oper. Res. 40(7): 1829-1841 (2013) - [j35]Marco Dorigo, Mauro Birattari, Christian Blum, Anders Lyhne Christensen, Andries P. Engelbrecht, Roderich Groß, Thomas Stützle:
ANTS 2012 special issue - Editorial. Swarm Intell. 7(2-3): 79-81 (2013) - 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. Ann. Oper. Res. 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. Comput. Math. Appl. 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. Comput. Oper. Res. 39(2): 213-224 (2012) - [j30]Vera C. Hemmelmayr, Verena Schmid, Christian Blum:
Variable neighbourhood search for the variable sized bin packing problem. Comput. Oper. Res. 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 Intell. 6(2): 117-150 (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. Comput. Oper. Res. 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) - 2010
- [j22]Christian Blum:
Hybrid Metaheuristics. Comput. Oper. Res. 37(3): 430-431 (2010) - [j21]Manuel López-Ibáñez, Christian Blum:
Beam-ACO for the travelling salesman problem with time windows. Comput. Oper. Res. 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. Artif. Intell. 23(5): 650-659 (2010) - 2009
- [j19]Christian Blum, Maria J. Blesa, Manuel López-Ibáñez:
Beam search for the longest common subsequence problem. Comput. Oper. Res. 36(12): 3178-3186 (2009) - [j18]Christian Blum:
Book review. Comput. Sci. Rev. 3(4): 263-267 (2009) - [j17]Hugo Hernández, Christian Blum:
Ant colony optimization for multicasting in static wireless ad-hoc networks. Swarm Intell. 3(2): 125-148 (2009) - 2008
- [j16]Christian Blum, Mateu Yábar Vallès, Maria J. Blesa:
An ant colony optimization algorithm for DNA sequencing by hybridization. Comput. Oper. Res. 35(11): 3620-3635 (2008) - [j15]Christian Blum:
Beam-ACO for Simple Assembly Line Balancing. INFORMS J. Comput. 20(4): 618-627 (2008) - 2007
- [j14]Christian Blum:
Revisiting dynamic programming for finding optimal subtrees in trees. Eur. J. Oper. Res. 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 Comput. Appl. 16(3): 235-247 (2007) - 2006
- [j11]Christian Blum, Andrea Roli, Michael Sampels:
Editorial. J. Math. Model. Algorithms 5(1): 1-3 (2006) - 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. Comput. Oper. Res. 32: 1355-1377 (2005) - [j8]Christian Blum:
Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling. Comput. Oper. Res. 32: 1565-1591 (2005) - [j7]Daniel Merkle, Christian Blum:
Swarm Intelligence - An Optimization-Based Introduction. Künstliche Intell. 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. Evol. Comput. 9(2): 159-174 (2005) - 2004
- [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 Trans. Syst. Man Cybern. Part B 34(2): 1161-1172 (2004) - 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. Discret. Appl. Math. 128(2-3): 511-540 (2003)
Conference and Workshop Papers
- 2024
- [c109]Mehmet Anil Akbay, Christian Blum:
Two Examples for the Usefulness of STNWeb for Analyzing Optimization Algorithm Behavior. MIC (2) 2024: 341-346 - [c108]Jaume Reixach, Christian Blum:
Extending CMSA with Reinforcement Learning: Application to Minimum Dominating Set. MIC (2) 2024: 354-359 - [c107]Camilo Chacón Sartori, Christian Blum:
STNWeb for the Analysis of Optimization Algorithms: A Short Introduction. MIC (2) 2024: 367-372 - [c106]Jaume Reixach, Christian Blum, Marko Djukanovic, Günther R. Raidl:
A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem. EvoStar 2024: 1-15 - [c105]Mehmet Anil Akbay, Christian Blum, Michella Saliba:
The Electric Vehicle Problem with Road Junctions and Road Types: An Ant Colony Optimization Approach. GECCO 2024 - [c104]Camilo Chacón Sartori, Christian Blum, Gabriela Ochoa:
An Extension of STNWeb Functionality: On the Use of Hierarchical Agglomerative Clustering as an Advanced Search Space Partitioning Strategy. GECCO 2024 - [c103]Camilo Chacón Sartori, Christian Blum, Gabriela Ochoa:
Large Language Models for the Automated Analysis of Optimization Algorithms. GECCO 2024 - [c102]Marko Djukanovic, Aleksandar Kartelj, Tome Eftimov, Jaume Reixach, Christian Blum:
Efficient Search Algorithms for the Restricted Longest Common Subsequence Problem. ICCS (5) 2024: 58-73 - 2023
- [c101]Mehmet Anil Akbay, Can Berk Kalayci, Christian Blum:
Application of Adapt-CMSA to the Two-Echelon Electric Vehicle Routing Problem with Simultaneous Pickup and Deliveries. EvoCOP 2023: 16-33 - [c100]Christian Blum, Pedro Pinacho Davidson:
Application of Negative Learning Ant Colony Optimization to the Far from Most String Problem. EvoCOP 2023: 82-97 - [c99]Jairo Enrique Ramírez Sánchez, Camilo Chacón Sartori, Christian Blum:
Q-Learning Ant Colony Optimization supported by Deep Learning for Target Set Selection. GECCO 2023: 357-366 - [c98]Camilo Chacón Sartori, Christian Blum, Gabriela Ochoa:
Search Trajectory Networks Meet the Web: A Web Application for the Visual Comparison of Optimization Algorithms. ICSCA 2023: 89-96 - 2022
- [c97]Roberto Maria Rosati, Lucas Kletzander, Christian Blum, Nysret Musliu, Andrea Schaerf:
Construct, Merge, Solve and Adapt Applied to a Bus Driver Scheduling Problem with Complex Break Constraints. AI*IA 2022: 254-267 - [c96]Mehmet Anil Akbay, Can Berk Kalayci, Christian Blum:
Application of CMSA to the Electric Vehicle Routing Problem with Time Windows, Simultaneous Pickup and Deliveries, and Partial Vehicle Charging. MIC 2022: 1-16 - [c95]Roberto Maria Rosati, Salim Bouamama, Christian Blum:
Construct, Merge, Solve and Adapt Applied to the Maximum Disjoint Dominating Sets Problem. MIC 2022: 306-321 - [c94]Camilo Chacón Sartori, Christian Blum:
Boosting a Genetic Algorithm with Graph Neural Networks for Multi-Hop Influence Maximization in Social Networks. FedCSIS 2022: 363-371 - [c93]Albert López Serrano, Christian Blum:
A biased random key genetic algorithm applied to target set selection in viral marketing. GECCO 2022: 241-250 - [c92]Guillem Rodríguez Corominas, Christian Blum, Maria J. Blesa:
Negative learning Ant colony optimization for network alignment. GECCO 2022: 278-286 - [c91]Marko Djukanovic, Dragan Matic, Christian Blum, Aleksandar Kartelj:
Application of A* to the Generalized Constrained Longest Common Subsequence Problem with Many Pattern Strings. ICPRAI (2) 2022: 53-64 - 2021
- [c90]Mehmet Anil Akbay, Christian Blum:
Application of CMSA to the Minimum Positive Influence Dominating Set Problem. CCIA 2021: 17-26 - [c89]Albert López Serrano, Teddy Nurcahyadi, Salim Bouamama, Christian Blum:
Negative learning ant colony optimization for the minimum positive influence dominating set problem. GECCO Companion 2021: 1974-1977 - [c88]Teddy Nurcahyadi, Christian Blum:
Negative Learning in Ant Colony Optimization: Application to the Multi Dimensional Knapsack Problem. ISMSI 2021: 22-27 - 2020
- [c87]Teddy Nurcahyadi, Christian Blum:
A New Approach for Making Use of Negative Learning in Ant Colony Optimization. ANTS Conference 2020: 16-28 - [c86]Gabriela Ochoa, Katherine M. Malan, Christian Blum:
Search Trajectory Networks of Population-Based Algorithms in Continuous Spaces. EvoApplications 2020: 70-85 - [c85]Bohan Li, Xindi Zhang, Shaowei Cai, Jinkun Lin, Yiyuan Wang, Christian Blum:
NuCDS: An Efficient Local Search Algorithm for Minimum Connected Dominating Set. IJCAI 2020: 1503-1510 - [c84]Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum:
On Solving a Generalized Constrained Longest Common Subsequence Problem. OPTIMA 2020: 55-70 - [c83]Matthias Horn, Marko Djukanovic, Christian Blum, Günther R. Raidl:
On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences. OPTIMA 2020: 134-149 - 2019
- [c82]Christian Blum, Dhananjay R. Thiruvady, Andreas T. Ernst, Matthias Horn, Günther R. Raidl:
A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem. Australasian Conference on Artificial Intelligence 2019: 549-560 - [c81]Marko Djukanovic, Günther R. Raidl, Christian Blum:
A Heuristic Approach for Solving the Longest Common Square Subsequence Problem. EUROCAST (1) 2019: 429-437 - [c80]Divansh Arora, Parikshit Maini, Pedro Pinacho Davidson, Christian Blum:
Route planning for cooperative air-ground robots with fuel constraints: an approach based on CMSA. GECCO 2019: 207-214 - [c79]Pedro Pinacho Davidson, Salim Bouamama, Christian Blum:
Application of CMSA to the minimum capacitated dominating set problem. GECCO 2019: 321-328 - [c78]Guillem Rodríguez Corominas, Christian Blum, Maria J. Blesa:
A biased random key genetic algorithm for the weighted independent domination problem. GECCO (Companion) 2019: 2052-2055 - [c77]Christian Blum, Haroldo Gambini Santos:
Generic CP-Supported CMSA for Binary Integer Linear Programs. HM 2019: 1-15 - [c76]Dhananjay R. Thiruvady, Christian Blum, Andreas T. Ernst:
Maximising the Net Present Value of Project Schedules Using CMSA and Parallel ACO. HM 2019: 16-30 - [c75]Marko Djukanovic, Günther R. Raidl, Christian Blum:
A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation. LOD 2019: 154-167 - 2018
- [c74]Filippo Bistaffa, Juan A. Rodríguez-Aguilar, Jesús Cerquides, Christian Blum:
A Simulation Tool for Large-Scale Online Ridesharing. AAMAS 2018: 1797-1799 - [c73]Ewa Andrejczuk, Filippo Bistaffa, Christian Blum, Juan A. Rodríguez-Aguilar, Carles Sierra:
Solving the Synergistic Team Composition Problem. AAMAS 2018: 1853-1855 - [c72]Marko Djukanovic, Günther R. Raidl, Christian Blum:
Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem. LION 2018: 199-214 - [c71]Aritz Pérez, Christian Blum, José Antonio Lozano:
Approximating the maximum weighted decomposable graph problem with applications to probabilistic graphical models. PGM 2018: 320-331 - [c70]Ewa Andrejczuk, Filippo Bistaffa, Christian Blum, Juan A. Rodríguez-Aguilar, Carles Sierra:
Heterogeneous Teams for Homogeneous Performance. PRIMA 2018: 89-105 - 2017
- [c69]Christian Blum, Maria J. Blesa:
A hybrid evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem. CEC 2017: 129-136 - [c68]Evelia Lizárraga, Maria J. Blesa, Christian Blum:
Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When? EvoCOP 2017: 60-74 - [c67]Pedro Pinacho Davidson, Christian Blum, José Antonio Lozano:
The Weighted Independent Domination Problem: ILP Model and Algorithmic Approaches. EvoCOP 2017: 201-214 - [c66]Salim Bouamama, Christian Blum:
On solving large-scale instances of the knapsack problem with setup by means of an iterated greedy algorithm. ICSC 2017: 342-347 - [c65]Matthias Horn, Günther R. Raidl, Christian Blum:
Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment. MOD 2017: 506-518 - 2016
- [c64]Christian Blum, Maria J. Blesa:
Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem. EvoCOP 2016: 46-57 - [c63]Christian Blum, Jordi Pereira:
Extension of the CMSA Algorithm: An LP-based Way for Reducing Sub-instances. GECCO 2016: 285-292 - [c62]Christian Blum:
Construct, Merge, Solve and Adapt: Application to Unbalanced Minimum Common String Partition. HM 2016: 17-31 - [c61]Christian Blum, Christine Zarges:
The Workshops at PPSN 2016. PPSN 2016: 1007-1011 - 2015
- [c60]Evelia Lizárraga, Maria J. Blesa, Christian Blum, Günther R. Raidl:
On solving the most strings with few bad columns problem: An ILP model and heuristics. INISTA 2015: 1-8 - 2014
- [c59]Christian Blum, Maria J. Blesa, Borja Calvo:
Can Frogs Find Large Independent Sets in a Decentralized Way? Yes They Can! ANTS Conference 2014: 74-85 - [c58]Christian Blum, Paola Festa:
A Hybrid Ant Colony Optimization Algorithm for the Far From Most String Problem. EvoCOP 2014: 1-12 - [c57]Christian Blum, Maria J. Blesa, Carlos García-Martínez, Francisco J. Rodríguez, Manuel Lozano:
The Firefighter Problem: Application of Hybrid Ant Colony Optimization Algorithms. EvoCOP 2014: 218-229 - [c56]Christian Blum, José Antonio Lozano, Pedro Pinacho Davidson:
Iterative Probabilistic Tree Search for the Minimum Common String Partition Problem. Hybrid Metaheuristics 2014: 145-154 - [c55]Aritz Pérez, Christian Blum, José Antonio Lozano:
Learning Maximum Weighted (k+1)-Order Decomposable Graphs by Integer Linear Programming. Probabilistic Graphical Models 2014: 396-408 - 2013
- [c54]Christian Blum, Maria J. Blesa, Borja Calvo:
Beam-ACO for the Repetition-Free Longest Common Subsequence Problem. Artificial Evolution 2013: 79-90 - [c53]Christian Blum, Verena Schmid:
Solving the 2D Bin Packing Problem by Means of a Hybrid Evolutionary Algorithm. ICCS 2013: 899-908 - 2012
- [c52]Sergi Mateo, Christian Blum, Pascal Fua, Engin Türetken:
Hybrid Algorithms for the Minimum-Weight Rooted Arborescence Problem. ANTS 2012: 61-72 - [c51]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 - [c50]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 - [c49]Christian Blum:
Hybrid Metaheuristics in Combinatorial Optimization: A Tutorial. TPNC 2012: 1-10 - 2011
- [c48]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 - [c47]Christian Blum:
Ant colony optimization. GECCO (Companion) 2011: 963-990 - [c46]Lukas Baumgartner, Verena Schmid, Christian Blum:
Solving the Two-Dimensional Bin Packing Problem with a Probabilistic Multi-start Heuristic. LION 2011: 76-90 - [c45]Hugo Hernández, Christian Blum:
Distributed graph coloring in wireless ad hoc networks: A light-weight algorithm based on Japanese tree frogs' calling behaviour. WMNC 2011: 1-7 - [c44]James M. Hereford, Christian Blum:
FlockOpt: A new swarm optimization algorithm based on collective behavior of starling birds. NaBIC 2011: 17-22 - 2010
- [c43]Christian Blum:
Beam-ACO for the longest common subsequence problem. IEEE Congress on Evolutionary Computation 2010: 1-8 - [c42]Manuel Lozano, Christian Blum:
A Hybrid Metaheuristic for the Longest Common Subsequence Problem. Hybrid Metaheuristics 2010: 1-15 - [c41]Christian Blum, Vera C. Hemmelmayr, Hugo Hernández, Verena Schmid:
Hybrid Algorithms for the Variable Sized Bin Packing Problem. Hybrid Metaheuristics 2010: 16-30 - [c40]Stefano Benedettini, Christian Blum, Andrea Roli:
A Randomized Iterated Greedy Algorithm for the Founder Sequence Reconstruction Problem. LION 2010: 37-51 - [c39]Engin Türetken, Christian Blum, Germán González, Pascal Fua:
Reconstructing Geometrically Consistent Tree Structures from Noisy Images. MICCAI (1) 2010: 291-299 - [c38]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 - 2009
- [c37]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 - [c36]Hugo Hernández, Christian Blum:
Self-synchronized duty-cycling in sensor networks with energy harvesting capabilities: the static network case. GECCO 2009: 33-40 - [c35]Christian Blum:
Ant colony optimization. GECCO (Companion) 2009: 2825-2852 - [c34]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 - [c33]Hugo Hernández, Christian Blum:
Asynchronous simulation of a self-synchronized duty-cycling mechanism for mobile sensor networks. BADS@ICAC 2009: 61-68 - [c32]Andrea Roli, Christian Blum:
Tabu Search for the Founder Sequence Reconstruction Problem: A Preliminary Study. IWANN (2) 2009: 1035-1042 - [c31]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 - [c30]Hugo Hernández, Christian Blum, Martin Middendorf, Kai Ramsch, Alexander Scheidler:
Self-synchronized duty-cycling for mobile sensor networks with energy harvesting capabilities: A swarm intelligence study. SIS 2009: 153-159 - 2008
- [c29]Hugo Hernández, Christian Blum, Guillem Francès:
Ant Colony Optimization for Energy-Efficient Broadcasting in Ad-Hoc Networks. ANTS Conference 2008: 25-36 - [c28]Alexander Scheidler, Christian Blum, Daniel Merkle, Martin Middendorf:
Emergent Sorting in Networks of Router Agents. ANTS Conference 2008: 299-306 - [c27]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 - [c26]Hugo Hernández, Christian Blum:
Energy-efficient multicasting in wireless ad-hoc networks: An ant colony optimization approach. ISWCS 2008: 667-671 - 2007
- [c25]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 - [c24]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 - [c23]Christian Blum:
Ant Colony Optimization: Introduction and Hybridizations. HIS 2007: 24-29 - [c22]Christian Blum, Monaldo Mastrolilli:
Using Branch & Bound Concepts in Construction-Based Metaheuristics: Exploiting the Dual Problem Knowledge. Hybrid Metaheuristics 2007: 123-139 - [c21]Christian Blum, Maria J. Blesa:
Probabilistic Beam Search for the Longest Common Subsequence Problem. SLS 2007: 150-161 - 2006
- [c20]Christian Blum, Joaquín Bautista, Jordi Pereira:
Beam-ACO Applied to Assembly Line Balancing. ANTS Workshop 2006: 96-107 - [c19]Christian Blum:
A new hybrid evolutionary algorithm for the huge k-cardinality tree problem. GECCO 2006: 515-522 - [c18]Christian Blum, Mateu Yábar Vallès:
Multi-level Ant Colony Optimization for DNA Sequencing by Hybridization. Hybrid Metaheuristics 2006: 94-109 - [c17]Maria J. Blesa, Christian Blum:
A nature-inspired algorithm for the disjoint paths problem. IPDPS 2006 - [c16]Christian Blum, Mateu Yábar Vallès:
New Constructive Heuristics for DNA Sequencing by Hybridization. WABI 2006: 355-365 - 2005
- [c15]Christian Blum, Krzysztof Socha:
Training feed-forward neural networks with ant colony optimization: An application to pattern classification. HIS 2005: 233-238 - [c14]Christian Blum, Maria J. Blesa:
Combining Ant Colony Optimization with Dynamic Programming for Solving the k-Cardinality Tree Problem. IWANN 2005: 25-33 - 2004
- [c13]Christian Blum, Marco Dorigo:
Deception in Ant Colony Optimization. ANTS Workshop 2004: 118-129 - [c12]Maria J. Blesa, Christian Blum:
Ant Colony Optimization for the Maximum Edge-Disjoint Paths Problem. EvoWorkshops 2004: 160-169 - 2002
- [c11]Christian Blum:
ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversification. Ant Algorithms 2002: 14-27 - [c10]Christian Blum, Michael Sampels:
Ant colony optimization for FOP shop scheduling: a case study on different pheromone representations. IEEE Congress on Evolutionary Computation 2002: 1558-1563 - [c9]Christian Blum:
Ant Colony Optimization For The Edge-weighted k-cardinality Tree Problem. GECCO 2002: 27-34 - [c8]Christian Blum, Michael Sampels, Mark Zlochin:
On A Particularity In Model-based Search. GECCO 2002: 35-42 - [c7]Michael Sampels, Christian Blum, Monaldo Mastrolilli, Olivia Rossi-Doria:
Metaheuristics for Group Shop Scheduling. PPSN 2002: 631-640 - [c6]Christian Blum, Michael Sampels:
When Model Bias Is Stronger than Selection Pressure. PPSN 2002: 893-902 - 2001
- [c5]Andrea Roli, Christian Blum:
Critical Parallelization of Local Search for MAX-SAT. AI*IA 2001: 147-158 - [c4]Margarita Sordo, John Fox, Christian Blum, Paul Taylor, Richard Lee, Eugenio Alberdi:
Combining Decision Support and Image Processing: A PROforma Model. MedInfo 2001: 547-551 - 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
Parts in Books or Collections
- 2018
- [p9]Maria J. Blesa, Christian Blum:
On Solving the Maximum Disjoint Paths Problem with Ant Colony Optimization. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - [p8]Guillermo Leguizamón, Christian Blum, Enrique Alba:
Evolutionary Computation. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 379-394 - 2015
- [p7]Christian Blum, Roderich Groß:
Swarm Intelligence in Optimization and Robotics. Handbook of Computational Intelligence 2015: 1291-1309 - [p6]Christian Blum, Sergi Mateo Bellido:
Ant Colony Optimization for the Minimum-Weight Rooted Arborescence Problem. Handbook of Computational Intelligence 2015: 1333-1343 - 2013
- [p5]Pedro J. Copado-Méndez, Christian Blum, Gonzalo Guillén-Gosálbez, Laureano Jiménez:
Application of Large Neighborhood Search to Strategic Supply Chain Management in the Chemical Industry. Hybrid Metaheuristics 2013: 335-352 - 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 - 2008
- [p3]Christian Blum, Xiaodong Li:
Swarm Intelligence in Optimization. Swarm Intelligence 2008: 43-85 - [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
Editorship
- 2020
- [e23]Marco Dorigo, Thomas Stützle, Maria J. Blesa, Christian Blum, Heiko Hamann, Mary Katherine Heinrich, Volker Strobel:
Swarm Intelligence - 12th International Conference, ANTS 2020, Barcelona, Spain, October 26-28, 2020, Proceedings. Lecture Notes in Computer Science 12421, Springer 2020, ISBN 978-3-030-60375-5 [contents] - 2019
- [e22]María J. Blesa Aguilera, Christian Blum, Haroldo Gambini Santos, Pedro Pinacho Davidson, Julio Godoy del Campo:
Hybrid Metaheuristics - 11th International Workshop, HM 2019, Concepción, Chile, January 16-18, 2019, Proceedings. Lecture Notes in Computer Science 11299, Springer 2019, ISBN 978-3-030-05982-8 [contents] - 2018
- [e21]Marco Dorigo, Mauro Birattari, Christian Blum, Anders Lyhne Christensen, Andreagiovanni Reina, Vito Trianni:
Swarm Intelligence - 11th International Conference, ANTS 2018, Rome, Italy, October 29-31, 2018, Proceedings. Lecture Notes in Computer Science 11172, Springer 2018, ISBN 978-3-030-00532-0 [contents] - 2016
- [e20]Maria J. Blesa, Christian Blum, Angelo Cangelosi, Vincenzo Cutello, Alessandro G. Di Nuovo, Mario Pavone, El-Ghazali Talbi:
Hybrid Metaheuristics - 10th International Workshop, HM 2016, Plymouth, UK, June 8-10, 2016, Proceedings. Lecture Notes in Computer Science 9668, Springer 2016, ISBN 978-3-319-39635-4 [contents] - 2014
- [e19]Christian Blum, Gabriela Ochoa:
Evolutionary Computation in Combinatorial Optimisation - 14th European Conference, EvoCOP 2014, Granada, Spain, April 23-25, 2014, Revised Selected Papers. Lecture Notes in Computer Science 8600, Springer 2014, ISBN 978-3-662-44319-4 [contents] - [e18]Maria J. Blesa, Christian Blum, Stefan Voß:
Hybrid Metaheuristics - 9th International Workshop, HM 2014, Hamburg, Germany, June 11-13, 2014. Proceedings. Lecture Notes in Computer Science 8457, Springer 2014, ISBN 978-3-319-07643-0 [contents] - 2013
- [e17]Martin Middendorf, Christian Blum:
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 [contents] - [e16]Christian Blum, Enrique Alba:
Genetic and Evolutionary Computation Conference, GECCO '13, Amsterdam, The Netherlands, July 6-10, 2013. ACM 2013, ISBN 978-1-4503-1963-8 [contents] - [e15]Christian Blum, Enrique Alba:
Genetic and Evolutionary Computation Conference, GECCO '13, Amsterdam, The Netherlands, July 6-10, 2013, Companion Material Proceedings. ACM 2013, ISBN 978-1-4503-1964-5 [contents] - [e14]Maria J. Blesa, Christian Blum, Paola Festa, Andrea Roli, Michael Sampels:
Hybrid Metaheuristics - 8th International Workshop, HM 2013, Ischia, Italy, May 23-25, 2013. Proceedings. Lecture Notes in Computer Science 7919, Springer 2013, ISBN 978-3-642-38515-5 [contents] - 2012
- [e13]Marco Dorigo, Mauro Birattari, Christian Blum, Anders Lyhne Christensen, Andries P. Engelbrecht, Roderich Groß, Thomas Stützle:
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 [contents] - 2010
- [e12]Maria J. Blesa, Christian Blum, Günther R. Raidl, Andrea Roli, Michael Sampels:
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 [contents] - [e11]Christian Blum, Roberto Battiti:
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 [contents] - 2009
- [e10]Maria J. Blesa, Christian Blum, Luca Di Gaspero, Andrea Roli, Michael Sampels, Andrea Schaerf:
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 [contents] - 2008
- [e9]Marco Dorigo, Mauro Birattari, Christian Blum, Maurice Clerc, Thomas Stützle, Alan F. T. Winfield:
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 [contents] - [e8]Maria J. Blesa, Christian Blum, Carlos Cotta, Antonio J. Fernández, José E. Gallardo, Andrea Roli, Michael Sampels:
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 [contents] - [e7]Christian Blum, Daniel Merkle:
Swarm Intelligence: Introduction and Applications. Natural Computing Series, Springer 2008, ISBN 978-3-540-74088-9 [contents] - [e6]Christian Blum, María J. Blesa Aguilera, Andrea Roli, Michael Sampels:
Hybrid Metaheuristics, An Emerging Approach to Optimization. Studies in Computational Intelligence 114, Springer 2008, ISBN 978-3-540-78294-0 [contents] - 2007
- [e5]Thomas Bartz-Beielstein, María J. Blesa Aguilera, Christian Blum, Boris Naujoks, Andrea Roli, Günter Rudolph, Michael Sampels:
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 [contents] - 2006
- [e4]Francisco Almeida, María J. Blesa Aguilera, Christian Blum, J. Marcos Moreno-Vega, Melquíades Pérez Pérez, Andrea Roli, Michael Sampels:
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 [contents] - 2005
- [e3]Maria J. Blesa, Christian Blum, Andrea Roli, Michael Sampels:
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 [contents] - 2004
- [e2]Marco Dorigo, Mauro Birattari, Christian Blum, Luca Maria Gambardella, Francesco Mondada, Thomas Stützle:
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 [contents] - [e1]Christian Blum, Andrea Roli, Michael Sampels:
Hybrid Metaheuristics, First International Workshop, HM 2004, Valencia, Spain, August 22-23, 2004, Proceedings. 2004, ISBN 3-00-015331-4 [contents]
Reference Works
- 2018
- [r3]Christian Blum, Paola Festa:
Selected String Problems. Handbook of Heuristics 2018: 1221-1240 - 2007
- [r2]Maria J. Blesa, Christian Blum:
On Solving the Maximum Disjoint Paths Problem with Ant Colony Optimization. Handbook of Approximation Algorithms and Metaheuristics 2007 - [r1]Guillermo Leguizamón, Enrique Alba, Christian Blum:
Evolutionary Computation. Handbook of Approximation Algorithms and Metaheuristics 2007
Informal and Other Publications
- 2024
- [i16]Camilo Chacón Sartori, Christian Blum, Gabriela Ochoa:
Large Language Models for the Automated Analysis of Optimization Algorithms. CoRR abs/2402.08472 (2024) - [i15]Camilo Chacón Sartori, Christian Blum, Filippo Bistaffa, Guillem Rodríguez Corominas:
Metaheuristics and Large Language Models Join Forces: Towards an Integrated Optimization Approach. CoRR abs/2405.18272 (2024) - [i14]Guillem Rodríguez Corominas, Maria J. Blesa, Christian Blum:
Accelerating the k-means++ Algorithm by Using Geometric Information. CoRR abs/2408.13189 (2024) - [i13]Marko Djukanovic, Jaume Reixach, Ana Nikolikj, Tome Eftimov, Aleksandar Kartelj, Christian Blum:
A Learning Search Algorithm for the Restricted Longest Common Subsequence Problem. CoRR abs/2410.12031 (2024) - [i12]Camilo Chacón Sartori, Christian Blum, Filippo Bistaffa:
VisGraphVar: A Benchmark Generator for Assessing Variability in Graph Analysis Using Large Vision-Language Models. CoRR abs/2411.14832 (2024) - [i11]Mehmet Anil Akbay, Christian Blum:
Mathematical Formulations And Results Regarding Two Echelon Electric Vehicle Routing Problems. CoRR abs/2412.06671 (2024) - 2022
- [i10]Dhananjay R. Thiruvady, Su Nguyen, Christian Blum, Andreas T. Ernst:
An Efficient Merge Search Matheuristic for Maximising the Net Present Value of Project Schedules. CoRR abs/2210.11260 (2022) - 2019
- [i9]Ewa Andrejczuk, Filippo Bistaffa, Christian Blum, Juan A. Rodríguez-Aguilar, Carles Sierra:
Synergistic Team Composition: A Computational Approach to Foster Diversity in Teams. CoRR abs/1909.11994 (2019) - 2018
- [i8]Christian Blum, Haroldo Gambini Santos:
Generic CP-Supported CMSA for Binary Integer Linear Programs. CoRR abs/1805.11820 (2018) - 2017
- [i7]Christian Blum, Maria J. Blesa:
A Hybrid Evolutionary Algorithm Based on Solution Merging for the Longest Arc-Preserving Common Subsequence Problem. CoRR abs/1702.00318 (2017) - 2015
- [i6]Christian Blum, Günther R. Raidl:
Computational Performance Evaluation of Two Integer Linear Programming Models for the Minimum Common String Partition Problem. CoRR abs/1501.02388 (2015) - 2014
- [i5]Christian Blum, José Antonio Lozano, Pedro Pinacho Davidson:
Mathematical Programming Strategies for Solving the Minimum Common String Partition Problem. CoRR abs/1405.5646 (2014) - 2012
- [i4]Christian Blum, Verena Schmid, Lukas Baumgartner:
On Solving the Oriented Two-Dimensional Bin Packing Problem under Free Guillotine Cutting: Exploiting the Power of Probabilistic Solution Construction. CoRR abs/1209.0880 (2012) - 2010
- [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)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
