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
2020 – today
- 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- [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) - [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 - [i13]Camilo Chacón Sartori, Christian Blum, Gabriela Ochoa:
Large Language Models for the Automated Analysis of Optimization Algorithms. CoRR abs/2402.08472 (2024) - [i12]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) - [i11]Guillem Rodríguez Corominas, Maria J. Blesa, Christian Blum:
Accelerating the k-means++ Algorithm by Using Geometric Information. CoRR abs/2408.13189 (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) - [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
- [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) - [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 - [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) - 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) - [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
- [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) - [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 - [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]
2010 – 2019
- 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) - [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 - [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] - [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
- [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) - [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 - [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 - [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] - [r3]Christian Blum, Paola Festa:
Selected String Problems. Handbook of Heuristics 2018: 1221-1240 - [i8]Christian Blum, Haroldo Gambini Santos:
Generic CP-Supported CMSA for Binary Integer Linear Programs. CoRR abs/1805.11820 (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) - [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 - [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) - 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 - [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) - [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 - [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] - 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 decentra