| Publication | Date of Publication | Type |
|---|
An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine
Evolutionary Computation in Combinatorial Optimization | 2023-12-01 | Paper |
On permutation schedules for two-machine flow shops with buffer constraints and constant processing times on one machine
European Journal of Operational Research | 2022-07-22 | Paper |
Complete edge-colored permutation graphs
Advances in Applied Mathematics | 2022-06-13 | Paper |
| An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem | 2021-10-18 | Paper |
Coarse-Graining Large Search Landscapes Using Massive Edge Collapse
Mathematics and Visualization | 2021-01-28 | Paper |
An empirically based simulation of group foraging in the harvesting ant, \textit{Messor pergandei}
Journal of Theoretical Biology | 2019-05-14 | Paper |
A mathematical model of foraging in a dynamic environment by trail-laying Argentine ants
Journal of Theoretical Biology | 2018-09-27 | Paper |
Visualizing topological properties of the search landscape of combinatorial optimization problems
Mathematics and Visualization | 2017-09-25 | Paper |
Refined ranking relations for selection of solutions in multi objective metaheuristics
European Journal of Operational Research | 2016-10-06 | Paper |
| On weighting schemes for gene order analysis | 2014-02-27 | Paper |
Finding all sorting tandem duplication random loss operations
Journal of Discrete Algorithms | 2011-05-03 | Paper |
Honeybee optimisation - an overview and a new bee inspired optimisation scheme
Adaptation, Learning, and Optimization | 2011-03-11 | Paper |
Artificial bee colony optimization: a new selection scheme and its performance
Nature Inspired Cooperative Strategies for Optimization (NICSO 2010) | 2010-07-21 | Paper |
ADAPTING TO DYNAMIC ENVIRONMENTS: POLYETHISM IN RESPONSE THRESHOLD MODELS FOR SOCIAL INSECTS
Advances in Complex Systems | 2009-08-13 | Paper |
Finding All Sorting Tandem Duplication Random Loss Operations
Combinatorial Pattern Matching | 2009-07-07 | Paper |
Creating melodies and baroque harmonies with ant colony optimization
International Journal of Intelligent Computing and Cybernetics | 2008-09-25 | Paper |
A decentralization approach for swarm intelligence algorithms in networks applied to multi swarm PSO
International Journal of Intelligent Computing and Cybernetics | 2008-07-11 | Paper |
Self-organized task allocation for service tasks in computing systems with reconfigurable components
JMMA. Journal of Mathematical Modelling and Algorithms | 2008-06-11 | Paper |
Parallel Ant Colony Algorithms
Parallel Metaheuristics | 2007-03-05 | Paper |
Computational Science – ICCS 2005
Lecture Notes in Computer Science | 2005-11-30 | Paper |
On solving permutation scheduling problems with ant colony optimization
International Journal of Systems Science. Principles and Applications of Systems and Integration | 2005-11-15 | Paper |
DECENTRALIZED PACKET CLUSTERING IN ROUTER-BASED NETWORKS
International Journal of Foundations of Computer Science | 2005-09-12 | Paper |
Hyperreconfigurable architectures and the partition into hypercontexts problem
Journal of Parallel and Distributed Computing | 2005-06-30 | Paper |
Combined super-/substring and super-/subsequence problems
Theoretical Computer Science | 2004-08-10 | Paper |
| scientific article; zbMATH DE number 2079890 (Why is no real title available?) | 2004-08-03 | Paper |
| scientific article; zbMATH DE number 2079914 (Why is no real title available?) | 2004-08-03 | Paper |
On enforced convergence of ACO and its implementation on the reconfigurable mesh architecture using size reduction tasks
The Journal of Supercomputing | 2004-05-27 | Paper |
| scientific article; zbMATH DE number 1975099 (Why is no real title available?) | 2003-09-04 | Paper |
Ant colony optimization with global pheromone evaluation for scheduling a single machine
Applied Intelligence | 2003-08-06 | Paper |
On scheduling cycle shops: Classification, complexity and approximation
Journal of Scheduling | 2003-07-27 | Paper |
scientific article; zbMATH DE number 1908584 (Why is no real title available?)
Genetic Programming and Evolvable Machines | 2003-05-11 | Paper |
An evolutionary approach to dynamic task scheduling on FPGAs with restricted buffer.
Journal of Parallel and Distributed Computing | 2003-04-02 | Paper |
Multi colony ant algorithms
Journal of Heuristics | 2002-12-15 | Paper |
Width-restricted layering of acyclic digraphs with consideration of dummy nodes
Information Processing Letters | 2002-07-14 | Paper |
| scientific article; zbMATH DE number 1703864 (Why is no real title available?) | 2002-02-13 | Paper |
| scientific article; zbMATH DE number 1555947 (Why is no real title available?) | 2001-01-24 | Paper |
| scientific article; zbMATH DE number 1706205 (Why is no real title available?) | 2001-01-01 | Paper |
Transversal graphs for partially ordered sets: Sequencing, merging and scheduling problems
Journal of Combinatorial Optimization | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 1332659 (Why is no real title available?) | 1999-09-08 | Paper |
| scientific article; zbMATH DE number 1304057 (Why is no real title available?) | 1999-06-17 | Paper |
Scheduling inverse trees under the communication model of the LogP-machine
Theoretical Computer Science | 1999-04-28 | Paper |
| scientific article; zbMATH DE number 1236492 (Why is no real title available?) | 1999-01-06 | Paper |
Shortest common superstrings and scheduling with coordinated starting times
Theoretical Computer Science | 1998-08-13 | Paper |
Improved heuristics and a genetic algorithm for finding short supersequences
OR Spektrum | 1998-04-13 | Paper |
On Physical Mapping and the consecutive ones property for sparse matrices
Discrete Applied Mathematics | 1997-11-25 | Paper |
On finding minimal, maximal, and consistent sequences over a binary alphabet
Theoretical Computer Science | 1997-02-28 | Paper |
Two-Dimensional partitioning problems
Theoretical Computer Science | 1997-02-27 | Paper |
More on the complexity of common superstring and supersequence problems
Theoretical Computer Science | 1994-04-05 | Paper |
Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2
Information Processing Letters | 1993-10-17 | Paper |
