Christian Blum

According to our database1, Christian Blum authored at least 157 papers between 1997 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Minimum common string partition: on solving large-scale problem instances.
Int. Trans. Oper. Res., 2020

Anytime algorithms for the longest common palindromic subsequence problem.
Comput. Oper. Res., 2020

NuCDS: An Efficient Local Search Algorithm for Minimum Connected Dominating Set.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Search Trajectory Networks of Population-Based Algorithms in Continuous Spaces.
Proceedings of the Applications of Evolutionary Computation - 23rd European Conference, 2020

2019
ANTS 2018 special issue: Editorial.
Swarm Intell., 2019

Synergistic team composition: A computational approach to foster diversity in teams.
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

Maximising the Net Present Value of Project Schedules Using CMSA and Parallel ACO.
Proceedings of the Hybrid Metaheuristics - 11th International Workshop, 2019

Generic CP-Supported CMSA for Binary Integer Linear Programs.
Proceedings of the Hybrid Metaheuristics - 11th International Workshop, 2019

Application of CMSA to the minimum capacitated dominating set problem.
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

A Heuristic Approach for Solving the Longest Common Square Subsequence Problem.
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
Selected String Problems.
Proceedings of the Handbook of Heuristics., 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

Heterogeneous Teams for Homogeneous Performance.
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

A Simulation Tool for Large-Scale Online Ridesharing.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

Solving the Synergistic Team Composition Problem.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

Evolutionary Computation.
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
Large neighborhood search for the most strings with few bad columns problem.
Soft Comput., 2017

Mining k-reachable sets in real-world networks using domination in shortcut graphs.
J. Comput. Sci., 2017

Special issue on "Metaheuristics".
Int. Trans. Oper. Res., 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

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

The Weighted Independent Domination Problem: ILP Model and Algorithmic Approaches.
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
A hybrid algorithmic model for the minimum weight dominating set problem.
Simul. Model. Pract. Theory, 2016

Computational performance evaluation of two integer linear programming models for the minimum common string partition problem.
Optim. Lett., 2016

Editorial for the Special Issue on Combinatorial Optimization Problems.
Evol. Comput., 2016

Construct, Merge, Solve & Adapt A new general algorithm for combinatorial optimization.
Comput. Oper. Res., 2016

The Workshops at PPSN 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

Extension of the CMSA Algorithm: An LP-based Way for Reducing Sub-instances.
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

Hybrid Metaheuristics - Powerful Tools for Optimization
Artificial Intelligence: Foundations, Theory, and Algorithms, Springer, ISBN: 978-3-319-30883-8, 2016

2015
Swarm Intelligence in Optimization and Robotics.
Proceedings of the Springer Handbook of Computational Intelligence, 2015

Ant Colony Optimization for the Minimum-Weight Rooted Arborescence Problem.
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

A matheuristic for the minimum weight rooted arborescence problem.
J. Heuristics, 2015

Mathematical programming strategies for solving the minimum common string partition problem.
Eur. J. Oper. Res., 2015

The firefighter problem: Empirical results on random graphs.
Comput. Oper. Res., 2015

An Artificial Bioindicator System for Network Intrusion Detection.
Artif. Life, 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

Iterative Probabilistic Tree Search for the Minimum Common String Partition Problem.
Proceedings of the Hybrid Metaheuristics - 9th International Workshop, HM 2014, 2014

A Hybrid Ant Colony Optimization Algorithm for the Far From Most String Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimisation, 2014

The Firefighter Problem: Application of Hybrid Ant Colony Optimization Algorithms.
Proceedings of the Evolutionary Computation in Combinatorial Optimisation, 2014

Can Frogs Find Large Independent Sets in a Decentralized Way? Yes They Can!
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

ANTS 2012 special issue - Editorial.
Swarm Intell., 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

Solving the 2D Bin Packing Problem by Means of a Hybrid Evolutionary Algorithm.
Proceedings of the International Conference on Computational Science, 2013

Beam-ACO for the Repetition-Free Longest Common Subsequence Problem.
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

Variable neighbourhood search for the variable sized bin packing problem.
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

Hybrid Metaheuristics in Combinatorial Optimization: A Tutorial.
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

Iterated Greedy Algorithms for the Maximal Covering Location Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2012

Hybrid Algorithms for the Minimum-Weight Rooted Arborescence Problem.
Proceedings of the Swarm Intelligence - 8th International Conference, 2012

Evolutionary Optimization.
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

Foundations of Antcycle: Self-synchronized Duty-cycling in Mobile Sensor Networks.
Comput. J., 2011

Minimum energy broadcasting in wireless sensor networks: An ant colony optimization approach for a realistic antenna model.
Appl. Soft Comput., 2011

Hybrid metaheuristics in combinatorial optimization: A survey.
Appl. Soft Comput., 2011

Guest editorial: Special issue based on the LION 4 conference.
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

Beam-ACO for the travelling salesman problem with time windows.
Comput. Oper. Res., 2010

Hybrid Metaheuristics.
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

Reconstructing Geometrically Consistent Tree Structures from Noisy Images.
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

A Hybrid Metaheuristic for the Longest Common Subsequence Problem.
Proceedings of the Hybrid Metaheuristics - 7th International Workshop, 2010

Hybrid Algorithms for the Variable Sized Bin Packing Problem.
Proceedings of the Hybrid Metaheuristics - 7th International Workshop, 2010

Beam-ACO for the longest common subsequence problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2010

2009
Ant colony optimization for multicasting in static wireless ad-hoc networks.
Swarm Intell., 2009

Book review.
Comput. Sci. Rev., 2009

Beam search for the longest common subsequence problem.
Comput. Oper. Res., 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

Beam-ACO Based on Stochastic Sampling: A Case Study on the TSP with Time Windows.
Proceedings of the Learning and Intelligent Optimization, Third International Conference, 2009

Tabu Search for the Founder Sequence Reconstruction Problem: A Preliminary Study.
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

Hybridizing Beam-ACO with Constraint Programming for Single Machine Job Scheduling.
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

Ant colony optimization.
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
Hybrid Metaheuristics: An Introduction.
Proceedings of the Hybrid Metaheuristics, An Emerging Approach to Optimization, 2008

Hybridizations of Metaheuristics With Branch & Bound Derivates.
Proceedings of the Hybrid Metaheuristics, An Emerging Approach to Optimization, 2008

Swarm Intelligence in Optimization.
Proceedings of the Swarm Intelligence: Introduction and Applications, 2008

Beam-ACO for Simple Assembly Line Balancing.
INFORMS J. Comput., 2008

An ant colony optimization algorithm for DNA sequencing by hybridization.
Comput. Oper. Res., 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

Emergent Sorting in Networks of Router Agents.
Proceedings of the Ant Colony Optimization and Swarm Intelligence, 2008

Ant Colony Optimization for Energy-Efficient Broadcasting in Ad-Hoc Networks.
Proceedings of the Ant Colony Optimization and Swarm Intelligence, 2008

2007
Evolutionary Computation.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

On Solving the Maximum Disjoint Paths Problem with Ant Colony Optimization.
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

Finding Edge-disjoint Paths in Networks: An Ant Colony Optimization Algorithm.
J. Math. Model. Algorithms, 2007

Revisiting dynamic programming for finding optimal subtrees in trees.
Eur. J. Oper. Res., 2007

Probabilistic Beam Search for the Longest Common Subsequence Problem.
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

Ant Colony Optimization: Introduction and Hybridizations.
Proceedings of the 7th International Conference on Hybrid Intelligent Systems, 2007

ACO vs EAs for solving a real-world frequency assignment problem in GSM networks.
Proceedings of the Genetic and Evolutionary Computation Conference, 2007

A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2007

2006
Editorial.
J. Math. Model. Algorithms, 2006

New Constructive Heuristics for DNA Sequencing by Hybridization.
Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006

A nature-inspired algorithm for the disjoint paths problem.
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

Multi-level Ant Colony Optimization for DNA Sequencing by Hybridization.
Proceedings of the Hybrid Metaheuristics, Third International Workshop, 2006

A new hybrid evolutionary algorithm for the huge <i>k</i>-cardinality tree problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2006

Beam-ACO Applied to Assembly Line Balancing.
Proceedings of the Ant Colony Optimization and Swarm Intelligence, 2006

2005
Search bias in ant colony optimization: on the role of competition-balanced systems.
IEEE Trans. Evol. Comput., 2005

Ant colony optimization theory: A survey.
Theor. Comput. Sci., 2005

Swarm Intelligence - An Optimization-Based Introduction.
Künstliche Intell., 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

M. Dorigo and T. Stützle, Ant Colony Optimization.
Artif. Intell., 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
Theoretical and practical aspects of ant colony optimization.
PhD thesis, 2004

The hyper-cube framework for ant colony optimization.
IEEE Trans. Syst. Man Cybern. Part B, 2004

An Ant Colony Optimization Algorithm for Shop Scheduling Problems.
J. Math. Model. Algorithms, 2004

Ant Colony Optimization for the Maximum Edge-Disjoint Paths Problem.
Proceedings of the Applications of Evolutionary Computing, 2004

Deception in Ant Colony Optimization.
Proceedings of the Ant Colony Optimization and Swarm Intelligence, 2004

2003
Local Search Algorithms for the k-cardinality Tree Problem.
Discret. Appl. Math., 2003

Metaheuristics in combinatorial optimization: Overview and conceptual comparison.
ACM Comput. Surv., 2003

2002
Metaheuristics for Group Shop Scheduling.
Proceedings of the Parallel Problem Solving from Nature, 2002

When Model Bias Is Stronger than Selection Pressure.
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

ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversification.
Proceedings of the Ant Algorithms, Third International Workshop, 2002

2001
Combining Decision Support and Image Processing: A PROforma Model.
Proceedings of the MEDINFO 2001, 2001

Critical Parallelization of Local Search for MAX-SAT.
Proceedings of the AI*IA 2001: Advances in Artificial Intelligence, 2001

1997
Interpretation of a Hierarchical Neural Network.
Proceedings of the Biological and Artificial Computation: From Neuroscience to Technology, 1997

On the Role of Hierarchy for Neural Network Interpretation.
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997

Diagnosis and Monitoring of Ulnar Nerve Lesions.
Proceedings of the Artificial Intelligence Medicine, 1997


  Loading...