Christian Blum
Orcid: 0000-0002-1736-3559Affiliations:
- Artificial Intelligence Research Institute (IIIA-CSIC), Campus UAB, Bellaterra, Spain
- Spanish National Research Council, CSIC, Spain (former)
- University of the Basque Country, San Sebastian, Spain (former)
- IKERBASQUE, Basque Foundation for Science, Bilbao, Spain (former)
- Technical University of Catalonia, ALBCOM, Barcelona, Spain (former)
- Université libre de Bruxelles, Brussels, Belgium (PhD 2004)
- University of Kaiserslautern, Germany (former)
According to our database1,
Christian Blum
authored at least 202 papers
between 1997 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on iiia.csic.es
-
on orcid.org
-
on d-nb.info
-
on ehu.es
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
Comput. Oper. Res., January, 2024
CoRR, 2024
A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2024
2023
Self-adaptive CMSA for solving the multidimensional multi-way number partitioning problem.
Expert Syst. Appl., December, 2023
Softw. Impacts, September, 2023
Search Trajectory Networks Meet the Web: A Web Application for the Visual Comparison of Optimization Algorithms.
Proceedings of the 12th International Conference on Software and Computer Applications, 2023
Q-Learning Ant Colony Optimization supported by Deep Learning for Target Set Selection.
Proceedings of the Genetic and Evolutionary Computation Conference, 2023
Application of Negative Learning Ant Colony Optimization to the Far from Most String Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2023
Application of Adapt-CMSA to the Two-Echelon Electric Vehicle Routing Problem with Simultaneous Pickup and Deliveries.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2023
2022
Optimization Techniques and Formal Verification for the Software Design of Boolean Algebra Based Safety-Critical Systems.
IEEE Trans. Ind. Informatics, 2022
Sensors, 2022
Int. J. Comput. Intell. Syst., 2022
A Self-Adaptive Variant of CMSA: Application to the Minimum Positive Influence Dominating Set Problem.
Int. J. Comput. Intell. Syst., 2022
Comput. Sci. Rev., 2022
An Efficient Merge Search Matheuristic for Maximising the Net Present Value of Project Schedules.
CoRR, 2022
Graph search and variable neighborhood search for finding constrained longest common subsequences in artificial and real gene sequences.
Appl. Soft Comput., 2022
Application of A<sup>*</sup> to the Generalized Constrained Longest Common Subsequence Problem with Many Pattern Strings.
Proceedings of the Pattern Recognition and Artificial Intelligence, 2022
A biased random key genetic algorithm applied to target set selection in viral marketing.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022
Boosting a Genetic Algorithm with Graph Neural Networks for Multi-Hop Influence Maximization in Social Networks.
Proceedings of the 17th Conference on Computer Science and Intelligence Systems, 2022
Construct, Merge, Solve and Adapt Applied to the Maximum Disjoint Dominating Sets Problem.
Proceedings of the Metaheuristics - 14th International Conference, 2022
Application of CMSA to the Electric Vehicle Routing Problem with Time Windows, Simultaneous Pickup and Deliveries, and Partial Vehicle Charging.
Proceedings of the Metaheuristics - 14th International Conference, 2022
Construct, Merge, Solve and Adapt Applied to a Bus Driver Scheduling Problem with Complex Break Constraints.
Proceedings of the AIxIA 2022 - Advances in Artificial Intelligence, 2022
2021
A Computational Approach to Quantify the Benefits of Ridesharing for Policy Makers and Travellers.
IEEE Trans. Intell. Transp. Syst., 2021
An A<sup>⁎</sup> search algorithm for the constrained longest common subsequence problem.
Inf. Process. Lett., 2021
A comparative analysis of two matheuristics by means of merged local optima networks.
Eur. J. Oper. Res., 2021
Solving longest common subsequence problems via a transformation to the maximum clique problem.
Comput. Oper. Res., 2021
Search trajectory networks: A tool for analysing and visualising the behaviour of metaheuristics.
Appl. Soft Comput., 2021
An Improved Greedy Heuristic for the Minimum Positive Influence Dominating Set Problem in Social Networks.
Algorithms, 2021
A Greedy Heuristic for Maximizing the Lifetime of Wireless Sensor Networks Based on Disjoint Weighted Dominating Sets.
Algorithms, 2021
Negative Learning in Ant Colony Optimization: Application to the Multi Dimensional Knapsack Problem.
Proceedings of the ISMSI 2021: 2021 5th International Conference on Intelligent Systems, 2021
Negative learning ant colony optimization for the minimum positive influence dominating set problem.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021
Proceedings of the Artificial Intelligence Research and Development, 2021
2020
Int. Trans. Oper. Res., 2020
Comput. Oper. Res., 2020
Appl. Soft Comput., 2020
Algorithms, 2020
On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences.
Proceedings of the Optimization and Applications - 11th International Conference, 2020
Proceedings of the Optimization and Applications - 11th International Conference, 2020
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020
Proceedings of the Applications of Evolutionary Computation - 23rd European Conference, 2020
Proceedings of the Swarm Intelligence - 12th International Conference, 2020
2019
Knowl. Based Syst., 2019
An algorithm based on ant colony optimization for the minimum connected dominating set problem.
Appl. Soft Comput., 2019
Job sequencing with one common and multiple secondary resources: An A<sup>⁎</sup>/Beam Search based anytime algorithm.
Artif. Intell., 2019
A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation.
Proceedings of the Machine Learning, Optimization, and Data Science, 2019
Proceedings of the Hybrid Metaheuristics - 11th International Workshop, 2019
Proceedings of the Hybrid Metaheuristics - 11th International Workshop, 2019
Proceedings of the Genetic and Evolutionary Computation Conference, 2019
A biased random key genetic algorithm for the weighted independent domination problem.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019
Route planning for cooperative air-ground robots with fuel constraints: an approach based on CMSA.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019
Proceedings of the Computer Aided Systems Theory - EUROCAST 2019, 2019
A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem.
Proceedings of the AI 2019: Advances in Artificial Intelligence, 2019
2018
A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem.
J. Heuristics, 2018
The weighted independent domination problem: Integer linear programming models and metaheuristic approaches.
Eur. J. Oper. Res., 2018
ILP-Based Reduced Variable Neighborhood Search for Large-Scale Minimum Common String Partition.
Electron. Notes Discret. Math., 2018
Hybrid techniques based on solving reduced problem instances for a longest common subsequence problem.
Appl. Soft Comput., 2018
Proceedings of the PRIMA 2018: Principles and Practice of Multi-Agent Systems - 21st International Conference, Tokyo, Japan, October 29, 2018
Approximating the maximum weighted decomposable graph problem with applications to probabilistic graphical models.
Proceedings of the International Conference on Probabilistic Graphical Models, 2018
Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem.
Proceedings of the Learning and Intelligent Optimization - 12th International Conference, 2018
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
On Solving the Maximum Disjoint Paths Problem with Ant Colony Optimization.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
2017
Soft Comput., 2017
J. Comput. Sci., 2017
Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment.
Proceedings of the Machine Learning, Optimization, and Big Data, 2017
On solving large-scale instances of the knapsack problem with setup by means of an iterated greedy algorithm.
Proceedings of the 6th International Conference on Systems and Control, 2017
Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When?
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2017
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2017
A hybrid evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem.
Proceedings of the 2017 IEEE Congress on Evolutionary Computation, 2017
2016
Simul. Model. Pract. Theory, 2016
Computational performance evaluation of two integer linear programming models for the minimum common string partition problem.
Optim. Lett., 2016
Evol. Comput., 2016
Construct, Merge, Solve & Adapt A new general algorithm for combinatorial optimization.
Comput. Oper. Res., 2016
Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016
Construct, Merge, Solve and Adapt: Application to Unbalanced Minimum Common String Partition.
Proceedings of the Hybrid Metaheuristics - 10th International Workshop, 2016
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016
Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2016
Artificial Intelligence: Foundations, Theory, and Algorithms, Springer, ISBN: 978-3-319-30883-8, 2016
2015
Proceedings of the Springer Handbook of Computational Intelligence, 2015
Proceedings of the Springer Handbook of Computational Intelligence, 2015
FrogCOL and FrogMIS: new decentralized algorithms for finding large independent sets in graphs.
Swarm Intell., 2015
J. Heuristics, 2015
Mathematical programming strategies for solving the minimum common string partition problem.
Eur. J. Oper. Res., 2015
Comput. Oper. Res., 2015
On solving the most strings with few bad columns problem: An ILP model and heuristics.
Proceedings of the International Symposium on Innovations in Intelligent SysTems and Applications, 2015
2014
FrogSim: distributed graph coloring in wireless ad hoc networks - An algorithm inspired by the calling behavior of Japanese tree frogs.
Telecommun. Syst., 2014
Learning Maximum Weighted (k+1)-Order Decomposable Graphs by Integer Linear Programming.
Proceedings of the Probabilistic Graphical Models - 7th European Workshop, 2014
Proceedings of the Hybrid Metaheuristics - 9th International Workshop, HM 2014, 2014
Proceedings of the Evolutionary Computation in Combinatorial Optimisation, 2014
Proceedings of the Evolutionary Computation in Combinatorial Optimisation, 2014
Proceedings of the Swarm Intelligence - 9th International Conference, 2014
2013
Application of Large Neighborhood Search to Strategic Supply Chain Management in the Chemical Industry.
Proceedings of the Hybrid Metaheuristics, 2013
An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem.
Comput. Oper. Res., 2013
Large neighbourhood search applied to the efficient solution of spatially explicit strategic supply chain management problems.
Comput. Chem. Eng., 2013
The travelling salesman problem with time windows: Adapting algorithms from travel-time to makespan optimization.
Appl. Soft Comput., 2013
Proceedings of the International Conference on Computational Science, 2013
Proceedings of the Artificial Evolution, 2013
2012
Distributed graph coloring: an approach based on the calling behavior of Japanese tree frogs.
Swarm Intell., 2012
On Solving the Oriented Two-Dimensional Bin Packing Problem under Free Guillotine Cutting: Exploiting the Power of Probabilistic Solution Construction.
CoRR, 2012
Large neighbourhood search algorithms for the founder sequence reconstruction problem.
Comput. Oper. Res., 2012
Comput. Oper. Res., 2012
Distributed ant colony optimization for minimum energy broadcasting in sensor networks with realistic antennas.
Comput. Math. Appl., 2012
A population-based iterated greedy algorithm for the minimum weight vertex cover problem.
Appl. Soft Comput., 2012
GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times.
Ann. Oper. Res., 2012
Proceedings of the Theory and Practice of Natural Computing, 2012
An Artificial Bee Colony Algorithm for the Unrelated Parallel Machines Scheduling Problem.
Proceedings of the Parallel Problem Solving from Nature - PPSN XII, 2012
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2012
Proceedings of the Swarm Intelligence - 8th International Conference, 2012
Proceedings of the Variants of Evolutionary Algorithms for Real-World Applications, 2012
2011
Automated Reconstruction of Dendritic and Axonal Trees by Global Optimization with Geometric Priors.
Neuroinformatics, 2011
On solving the assembly line worker assignment and balancing problem via beam search.
Comput. Oper. Res., 2011
Comput. J., 2011
Minimum energy broadcasting in wireless sensor networks: An ant colony optimization approach for a realistic antenna model.
Appl. Soft Comput., 2011
Appl. Soft Comput., 2011
Ann. Math. Artif. Intell., 2011
FlockOpt: A new swarm optimization algorithm based on collective behavior of starling birds.
Proceedings of the Third World Congress on Nature & Biologically Inspired Computing, 2011
Distributed graph coloring in wireless ad hoc networks: A light-weight algorithm based on Japanese tree frogs' calling behaviour.
Proceedings of the 4th Joint IFIP Wireless and Mobile Networking Conference, 2011
Solving the Two-Dimensional Bin Packing Problem with a Probabilistic Multi-start Heuristic.
Proceedings of the Learning and Intelligent Optimization - 5th International Conference, 2011
Implementing a model of Japanese tree frogs' calling behavior in sensor networks: a study of possible improvements.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011
2010
On the use of different types of knowledge in metaheuristics based on constructing solutions.
Eng. Appl. Artif. Intell., 2010
Iterative Beam Search for Simple Assembly Line Balancing with a Fixed Number of Work Stations
CoRR, 2010
Comput. Oper. Res., 2010
A Protocol for Self-Synchronized Duty-Cycling in Sensor Networks: Generic Implementation in Wiselib.
Proceedings of the Sixth International Conference on Mobile Ad-hoc and Sensor Networks, 2010
Proceedings of the Medical Image Computing and Computer-Assisted Intervention, 2010
A Randomized Iterated Greedy Algorithm for the Founder Sequence Reconstruction Problem.
Proceedings of the Learning and Intelligent Optimization, 4th International Conference, 2010
Proceedings of the Hybrid Metaheuristics - 7th International Workshop, 2010
Proceedings of the Hybrid Metaheuristics - 7th International Workshop, 2010
Proceedings of the IEEE Congress on Evolutionary Computation, 2010
2009
Swarm Intell., 2009
Self-synchronized duty-cycling for mobile sensor networks with energy harvesting capabilities: A swarm intelligence study.
Proceedings of the 2009 IEEE Swarm Intelligence Symposium, 2009
Proceedings of the Learning and Intelligent Optimization, Third International Conference, 2009
Proceedings of the Distributed Computing, 2009
Asynchronous simulation of a self-synchronized duty-cycling mechanism for mobile sensor networks.
Proceedings of the 2009 workshop on Bio-inspired algorithms for distributed systems, 2009
Proceedings of the Hybrid Metaheuristics, 6th International Workshop, 2009
Self-synchronized duty-cycling in sensor networks with energy harvesting capabilities: the static network case.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009
Proceedings of the Genetic and Evolutionary Computation Conference, 2009
Beam-ACO Based on Stochastic Sampling for Makespan Optimization Concerning the TSP with Time Windows.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2009
2008
Proceedings of the Hybrid Metaheuristics, An Emerging Approach to Optimization, 2008
Proceedings of the Hybrid Metaheuristics, An Emerging Approach to Optimization, 2008
Proceedings of the Swarm Intelligence: Introduction and Applications, 2008
Comput. Oper. Res., 2008
Energy-efficient multicasting in wireless ad-hoc networks: An ant colony optimization approach.
Proceedings of the 2008 5th International Symposium on Wireless Communication Systems, 2008
An Extended Beam-ACO Approach to the Time and Space Constrained Simple Assembly Line Balancing Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2008
Proceedings of the Ant Colony Optimization and Swarm Intelligence, 2008
Proceedings of the Ant Colony Optimization and Swarm Intelligence, 2008
2007
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
An ant colony optimization algorithm for continuous optimization: application to feed-forward neural network training.
Neural Comput. Appl., 2007
J. Math. Model. Algorithms, 2007
Eur. J. Oper. Res., 2007
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007
Using Branch & Bound Concepts in Construction-Based Metaheuristics: Exploiting the Dual Problem Knowledge.
Proceedings of the Hybrid Metaheuristics, 4th International Workshop, 2007
Proceedings of the 7th International Conference on Hybrid Intelligent Systems, 2007
Proceedings of the Genetic and Evolutionary Computation Conference, 2007
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2007
2006
Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006
Proceedings of the Hybrid Metaheuristics, Third International Workshop, 2006
Proceedings of the Genetic and Evolutionary Computation Conference, 2006
Proceedings of the Ant Colony Optimization and Swarm Intelligence, 2006
2005
IEEE Trans. Evol. Comput., 2005
New metaheuristic approaches for the edge-weighted <i>k</i>-cardinality tree problem.
Comput. Oper. Res., 2005
Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling.
Comput. Oper. Res., 2005
Combining Ant Colony Optimization with Dynamic Programming for Solving the k-Cardinality Tree Problem.
Proceedings of the Computational Intelligence and Bioinspired Systems, 2005
Training feed-forward neural networks with ant colony optimization: An application to pattern classification.
Proceedings of the 5th International Conference on Hybrid Intelligent Systems (HIS 2005), 2005
2004
IEEE Trans. Syst. Man Cybern. Part B, 2004
J. Math. Model. Algorithms, 2004
Proceedings of the Applications of Evolutionary Computing, 2004
Proceedings of the Ant Colony Optimization and Swarm Intelligence, 2004
2003
Discret. Appl. Math., 2003
ACM Comput. Surv., 2003
2002
Proceedings of the Parallel Problem Solving from Nature, 2002
Proceedings of the Parallel Problem Solving from Nature, 2002
On A Particularity In Model-based Search.
Proceedings of the GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, 2002
Ant Colony Optimization For The Edge-weighted k-cardinality Tree Problem.
Proceedings of the GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, 2002
Ant colony optimization for FOP shop scheduling: a case study on different pheromone representations.
Proceedings of the 2002 Congress on Evolutionary Computation, 2002
ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversification.
Proceedings of the Ant Algorithms, Third International Workshop, 2002
2001
Proceedings of the MEDINFO 2001, 2001
Proceedings of the AI*IA 2001: Advances in Artificial Intelligence, 2001
1997
Proceedings of the Biological and Artificial Computation: From Neuroscience to Technology, 1997
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997
Proceedings of the Artificial Intelligence Medicine, 1997