Martin Middendorf

From MaRDI portal
Revision as of 10:45, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:242846

Available identifiers

zbMath Open middendorf.martinMaRDI QIDQ242846

List of research outcomes

PublicationDate of PublicationType
An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine2023-12-01Paper
On permutation schedules for two-machine flow shops with buffer constraints and constant processing times on one machine2022-07-22Paper
Complete edge-colored permutation graphs2022-06-13Paper
An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem2021-10-18Paper
Coarse-Graining Large Search Landscapes Using Massive Edge Collapse2021-01-28Paper
An empirically based simulation of group foraging in the harvesting ant, \textit{Messor pergandei}2019-05-14Paper
A mathematical model of foraging in a dynamic environment by trail-laying Argentine ants2018-09-27Paper
Visualizing Topological Properties of the Search Landscape of Combinatorial Optimization Problems2017-09-25Paper
Refined ranking relations for selection of solutions in multi objective metaheuristics2016-10-06Paper
https://portal.mardi4nfdi.de/entity/Q53983842014-02-27Paper
Finding all sorting tandem duplication random loss operations2011-05-03Paper
Honeybee Optimisation – An Overview and a New Bee Inspired Optimisation Scheme2011-03-11Paper
Artificial Bee Colony Optimization: A New Selection Scheme and Its Performance2010-07-21Paper
ADAPTING TO DYNAMIC ENVIRONMENTS: POLYETHISM IN RESPONSE THRESHOLD MODELS FOR SOCIAL INSECTS2009-08-13Paper
Finding All Sorting Tandem Duplication Random Loss Operations2009-07-07Paper
Creating melodies and baroque harmonies with ant colony optimization2008-09-25Paper
A decentralization approach for swarm intelligence algorithms in networks applied to multi swarm PSO2008-07-11Paper
Self-organized task allocation for service tasks in computing systems with reconfigurable components2008-06-11Paper
Parallel Ant Colony Algorithms2007-03-05Paper
Computational Science – ICCS 20052005-11-30Paper
On solving permutation scheduling problems with ant colony optimization2005-11-15Paper
DECENTRALIZED PACKET CLUSTERING IN ROUTER-BASED NETWORKS2005-09-12Paper
Hyperreconfigurable architectures and the partition into hypercontexts problem2005-06-30Paper
Combined super-/substring and super-/subsequence problems2004-08-10Paper
https://portal.mardi4nfdi.de/entity/Q44720262004-08-03Paper
https://portal.mardi4nfdi.de/entity/Q44720582004-08-03Paper
On enforced convergence of ACO and its implementation on the reconfigurable mesh architecture using size reduction tasks2004-05-27Paper
https://portal.mardi4nfdi.de/entity/Q44243202003-09-04Paper
Ant colony optimization with global pheromone evaluation for scheduling a single machine2003-08-06Paper
On scheduling cycle shops: Classification, complexity and approximation2003-07-27Paper
https://portal.mardi4nfdi.de/entity/Q48052822003-05-11Paper
An evolutionary approach to dynamic task scheduling on FPGAs with restricted buffer.2003-04-02Paper
Multi colony ant algorithms2002-12-15Paper
Width-restricted layering of acyclic digraphs with consideration of dummy nodes2002-07-14Paper
https://portal.mardi4nfdi.de/entity/Q27705042002-02-13Paper
https://portal.mardi4nfdi.de/entity/Q45257142001-01-24Paper
https://portal.mardi4nfdi.de/entity/Q27716582001-01-01Paper
Transversal graphs for partially ordered sets: Sequencing, merging and scheduling problems2000-03-19Paper
https://portal.mardi4nfdi.de/entity/Q42599801999-09-08Paper
https://portal.mardi4nfdi.de/entity/Q42507421999-06-17Paper
Scheduling inverse trees under the communication model of the LogP-machine1999-04-28Paper
https://portal.mardi4nfdi.de/entity/Q42238721999-01-06Paper
Shortest common superstrings and scheduling with coordinated starting times1998-08-13Paper
Improved heuristics and a genetic algorithm for finding short supersequences1998-04-13Paper
On Physical Mapping and the consecutive ones property for sparse matrices1997-11-25Paper
On finding minimal, maximal, and consistent sequences over a binary alphabet1997-02-28Paper
Two-Dimensional partitioning problems1997-02-27Paper
More on the complexity of common superstring and supersequence problems1994-04-05Paper
Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 21993-10-17Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Martin Middendorf