| Publication | Date of Publication | Type |
|---|
| A neural network based guidance for a BRKGA: an application to the longest common square subsequence problem | 2024-11-12 | Paper |
| Application of Adapt-CMSA to the two-echelon electric vehicle routing problem with simultaneous pickup and deliveries | 2024-01-12 | Paper |
| Application of negative learning ant colony optimization to the far from most string problem | 2024-01-12 | Paper |
| Minimum common string partition: on solving large‐scale problem instances | 2023-11-16 | Paper |
| Multi-constructor CMSA for the maximum disjoint dominating sets problem | 2023-11-15 | Paper |
| Hybridizations of evolutionary algorithms with large neighborhood search | 2023-06-20 | Paper |
| On solving a generalized constrained longest common subsequence problem | 2023-01-25 | Paper |
| On the use of decision diagrams for finding repetition-free longest common subsequences | 2023-01-25 | Paper |
| A comparative analysis of two matheuristics by means of merged local optima networks | 2021-06-03 | Paper |
| Solving longest common subsequence problems via a transformation to the maximum clique problem | 2021-04-20 | Paper |
| An \(A^\ast\) search algorithm for the constrained longest common subsequence problem | 2021-02-04 | Paper |
| The Weighted Independent Domination Problem: ILP Model and Algorithmic Approaches | 2020-08-05 | Paper |
| Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When? | 2020-08-05 | Paper |
| Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm | 2020-01-20 | Paper |
| Anytime algorithms for the longest common palindromic subsequence problem | 2019-11-19 | Paper |
| ILP-based reduced variable neighborhood search for large-scale minimum common string partition | 2018-10-11 | Paper |
| The weighted independent domination problem: integer linear programming models and metaheuristic approaches | 2017-11-23 | Paper |
| Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization | 2016-11-17 | Paper |
| An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem | 2016-11-10 | Paper |
| The firefighter problem: empirical results on random graphs | 2016-11-10 | Paper |
| Mathematical programming strategies for solving the minimum common string partition problem | 2016-07-26 | Paper |
| Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem | 2016-04-21 | Paper |
| Computational performance evaluation of two integer linear programming models for the minimum common string partition problem | 2016-02-23 | Paper |
| Beam-ACO for the Repetition-Free Longest Common Subsequence Problem | 2016-01-25 | Paper |
| Hybrid Metaheuristics: An Introduction | 2015-10-09 | Paper |
| Hybridizations of Metaheuristics With Branch & Bound Derivates | 2015-10-09 | Paper |
| Learning maximum weighted \((k+1)\)-order decomposable graphs by integer linear programming | 2015-01-14 | Paper |
| Iterative beam search for simple assembly line balancing with a fixed number of work stations | 2014-04-07 | Paper |
| Distributed ant colony optimization for minimum energy broadcasting in sensor networks with realistic antennas | 2013-07-25 | Paper |
| GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times | 2013-04-02 | Paper |
| Hybrid metaheuristics in combinatorial optimization: a tutorial | 2012-11-21 | Paper |
| Variable neighbourhood search for the variable sized bin packing problem | 2012-11-15 | Paper |
| Large neighbourhood search algorithms for the founder sequence reconstruction problem | 2012-11-15 | Paper |
| Iterated greedy algorithms for the maximal covering location problem | 2012-10-18 | Paper |
| Beam-ACO for simple assembly line balancing | 2012-07-28 | Paper |
| The photonic Wannier function approach to photonic crystal simulations status and perspectives | 2011-07-28 | Paper |
| Hybrid metaheuristics | 2010-12-22 | Paper |
| On solving the assembly line worker assignment and balancing problem via beam search | 2010-10-15 | Paper |
| Beam-ACO for the travelling salesman problem with time windows | 2010-03-18 | Paper |
| Guest editorial: Hybrid metaheuristics | 2009-11-17 | Paper |
| Beam search for the longest common subsequence problem | 2009-08-14 | Paper |
| An ant colony optimization algorithm for DNA sequencing by hybridization | 2008-04-28 | Paper |
| Finding edge-disjoint paths in networks: an ant colony optimization algorithm | 2008-01-14 | Paper |
| Ant colony optimization | 2008-01-02 | Paper |
| Probabilistic Beam Search for the Longest Common Subsequence Problem | 2007-11-29 | Paper |
| An Introduction to Metaheuristic Techniques | 2007-03-05 | Paper |
| Revisiting dynamic programming for finding optimal subtrees in trees | 2006-12-07 | Paper |
| Ant colony optimization theory: a survey | 2005-12-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4680528 | 2005-06-02 | Paper |
| Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling | 2005-02-22 | Paper |
| New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem | 2005-02-22 | Paper |
| An ant colony optimization algorithm for shop scheduling problems | 2005-01-17 | Paper |
| Local search algorithms for the \(k\)-cardinality tree problem. | 2003-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4799255 | 2003-03-18 | Paper |
