| 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
Evolutionary Computation in Combinatorial Optimization | 2024-01-12 | Paper |
Application of negative learning ant colony optimization to the far from most string problem
Evolutionary Computation in Combinatorial Optimization | 2024-01-12 | Paper |
Minimum common string partition: on solving large‐scale problem instances
International Transactions in Operational Research | 2023-11-16 | Paper |
Multi-constructor CMSA for the maximum disjoint dominating sets problem
Computers & Operations Research | 2023-11-15 | Paper |
Hybridizations of evolutionary algorithms with large neighborhood search
Computer Science Review | 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
European Journal of Operational Research | 2021-06-03 | Paper |
Solving longest common subsequence problems via a transformation to the maximum clique problem
Computers & Operations Research | 2021-04-20 | Paper |
An \(A^\ast\) search algorithm for the constrained longest common subsequence problem
Information Processing Letters | 2021-02-04 | Paper |
The weighted independent domination problem: ILP model and algorithmic approaches
Evolutionary Computation in Combinatorial Optimization | 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?
Evolutionary Computation in Combinatorial Optimization | 2020-08-05 | Paper |
Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm
Artificial Intelligence | 2020-01-20 | Paper |
Anytime algorithms for the longest common palindromic subsequence problem
Computers & Operations Research | 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
European Journal of Operational Research | 2017-11-23 | Paper |
Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
Computers & Operations Research | 2016-11-17 | Paper |
An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
Computers & Operations Research | 2016-11-10 | Paper |
The firefighter problem: empirical results on random graphs
Computers & Operations Research | 2016-11-10 | Paper |
Mathematical programming strategies for solving the minimum common string partition problem
European Journal of Operational Research | 2016-07-26 | Paper |
Construct, merge, solve and adapt: application to the repetition-free longest common subsequence problem
1519.68322 | 2016-04-21 | Paper |
Computational performance evaluation of two integer linear programming models for the minimum common string partition problem
Optimization Letters | 2016-02-23 | Paper |
Beam-ACO for the repetition-free longest common subsequence problem
| 2016-01-25 | Paper |
Hybrid metaheuristics: an introduction
Hybrid Metaheuristics | 2015-10-09 | Paper |
Hybridizations of metaheuristics with branch \& bound derivates
Hybrid Metaheuristics | 2015-10-09 | Paper |
Learning maximum weighted \((k+1)\)-order decomposable graphs by integer linear programming
Probabilistic Graphical Models | 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
Computers & Mathematics with Applications | 2013-07-25 | Paper |
GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
Annals of Operations Research | 2013-04-02 | Paper |
Hybrid metaheuristics in combinatorial optimization: a tutorial
Theory and Practice of Natural Computing | 2012-11-21 | Paper |
Variable neighbourhood search for the variable sized bin packing problem
Computers & Operations Research | 2012-11-15 | Paper |
Large neighbourhood search algorithms for the founder sequence reconstruction problem
Computers & Operations Research | 2012-11-15 | Paper |
Iterated greedy algorithms for the maximal covering location problem
Evolutionary Computation in Combinatorial Optimization | 2012-10-18 | Paper |
Beam-ACO for simple assembly line balancing
INFORMS Journal on Computing | 2012-07-28 | Paper |
The photonic Wannier function approach to photonic crystal simulations status and perspectives
Journal of Modern Optics | 2011-07-28 | Paper |
Hybrid metaheuristics
Hybrid Optimization | 2010-12-22 | Paper |
On solving the assembly line worker assignment and balancing problem via beam search
Computers & Operations Research | 2010-10-15 | Paper |
Beam-ACO for the travelling salesman problem with time windows
Computers & Operations Research | 2010-03-18 | Paper |
Guest editorial: Hybrid metaheuristics
Computers & Operations Research | 2009-11-17 | Paper |
Beam search for the longest common subsequence problem
Computers & Operations Research | 2009-08-14 | Paper |
An ant colony optimization algorithm for DNA sequencing by hybridization
Computers & Operations Research | 2008-04-28 | Paper |
Finding edge-disjoint paths in networks: an ant colony optimization algorithm
JMMA. Journal of Mathematical Modelling and Algorithms | 2008-01-14 | Paper |
Ant colony optimization
| 2008-01-02 | Paper |
Probabilistic Beam Search for the Longest Common Subsequence Problem
Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics | 2007-11-29 | Paper |
An Introduction to Metaheuristic Techniques
Parallel Metaheuristics | 2007-03-05 | Paper |
Revisiting dynamic programming for finding optimal subtrees in trees
European Journal of Operational Research | 2006-12-07 | Paper |
Ant colony optimization theory: a survey
Theoretical Computer Science | 2005-12-05 | Paper |
scientific article; zbMATH DE number 2173651 (Why is no real title available?)
| 2005-06-02 | Paper |
Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
Computers & Operations Research | 2005-02-22 | Paper |
New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem
Computers & Operations Research | 2005-02-22 | Paper |
An ant colony optimization algorithm for shop scheduling problems
JMMA. Journal of Mathematical Modelling and Algorithms | 2005-01-17 | Paper |
Local search algorithms for the \(k\)-cardinality tree problem.
Discrete Applied Mathematics | 2003-06-10 | Paper |
scientific article; zbMATH DE number 1884354 (Why is no real title available?)
| 2003-03-18 | Paper |
