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 | 2023-12-01 | Paper |
On permutation schedules for two-machine flow shops with buffer constraints and constant processing times on one machine | 2022-07-22 | Paper |
Complete edge-colored permutation graphs | 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 | 2021-01-28 | Paper |
An empirically based simulation of group foraging in the harvesting ant, \textit{Messor pergandei} | 2019-05-14 | Paper |
A mathematical model of foraging in a dynamic environment by trail-laying Argentine ants | 2018-09-27 | Paper |
Visualizing Topological Properties of the Search Landscape of Combinatorial Optimization Problems | 2017-09-25 | Paper |
Refined ranking relations for selection of solutions in multi objective metaheuristics | 2016-10-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q5398384 | 2014-02-27 | Paper |
Finding all sorting tandem duplication random loss operations | 2011-05-03 | Paper |
Honeybee Optimisation – An Overview and a New Bee Inspired Optimisation Scheme | 2011-03-11 | Paper |
Artificial Bee Colony Optimization: A New Selection Scheme and Its Performance | 2010-07-21 | Paper |
ADAPTING TO DYNAMIC ENVIRONMENTS: POLYETHISM IN RESPONSE THRESHOLD MODELS FOR SOCIAL INSECTS | 2009-08-13 | Paper |
Finding All Sorting Tandem Duplication Random Loss Operations | 2009-07-07 | Paper |
Creating melodies and baroque harmonies with ant colony optimization | 2008-09-25 | Paper |
A decentralization approach for swarm intelligence algorithms in networks applied to multi swarm PSO | 2008-07-11 | Paper |
Self-organized task allocation for service tasks in computing systems with reconfigurable components | 2008-06-11 | Paper |
Parallel Ant Colony Algorithms | 2007-03-05 | Paper |
Computational Science – ICCS 2005 | 2005-11-30 | Paper |
On solving permutation scheduling problems with ant colony optimization | 2005-11-15 | Paper |
DECENTRALIZED PACKET CLUSTERING IN ROUTER-BASED NETWORKS | 2005-09-12 | Paper |
Hyperreconfigurable architectures and the partition into hypercontexts problem | 2005-06-30 | Paper |
Combined super-/substring and super-/subsequence problems | 2004-08-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q4472026 | 2004-08-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q4472058 | 2004-08-03 | Paper |
On enforced convergence of ACO and its implementation on the reconfigurable mesh architecture using size reduction tasks | 2004-05-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q4424320 | 2003-09-04 | Paper |
Ant colony optimization with global pheromone evaluation for scheduling a single machine | 2003-08-06 | Paper |
On scheduling cycle shops: Classification, complexity and approximation | 2003-07-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q4805282 | 2003-05-11 | Paper |
An evolutionary approach to dynamic task scheduling on FPGAs with restricted buffer. | 2003-04-02 | Paper |
Multi colony ant algorithms | 2002-12-15 | Paper |
Width-restricted layering of acyclic digraphs with consideration of dummy nodes | 2002-07-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q2770504 | 2002-02-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q4525714 | 2001-01-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q2771658 | 2001-01-01 | Paper |
Transversal graphs for partially ordered sets: Sequencing, merging and scheduling problems | 2000-03-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q4259980 | 1999-09-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q4250742 | 1999-06-17 | Paper |
Scheduling inverse trees under the communication model of the LogP-machine | 1999-04-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q4223872 | 1999-01-06 | Paper |
Shortest common superstrings and scheduling with coordinated starting times | 1998-08-13 | Paper |
Improved heuristics and a genetic algorithm for finding short supersequences | 1998-04-13 | Paper |
On Physical Mapping and the consecutive ones property for sparse matrices | 1997-11-25 | Paper |
On finding minimal, maximal, and consistent sequences over a binary alphabet | 1997-02-28 | Paper |
Two-Dimensional partitioning problems | 1997-02-27 | Paper |
More on the complexity of common superstring and supersequence problems | 1994-04-05 | Paper |
Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2 | 1993-10-17 | Paper |