Jan H. M. Korst

From MaRDI portal
Revision as of 08:36, 6 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:1119181

Available identifiers

zbMath Open korst.jan-h-mMaRDI QIDQ1119181

List of research outcomes

PublicationDate of PublicationType
Improved metaheuristics for the quartet method of hierarchical clustering2021-04-28Paper
An exact algorithm for the minimum quartet tree cost problem2020-01-13Paper
Candle in the woods2017-10-20Paper
Random duplicate storage strategies for load balancing in multimedia servers2016-06-16Paper
Computer-assisted proof of performance ratios for the differencing method2012-07-12Paper
Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems2009-07-18Paper
Complexity of min-max subsequence problems2009-04-28Paper
https://portal.mardi4nfdi.de/entity/Q54318552008-01-02Paper
Bus and buffer usage in in-home digital networks: applying the dantzig-wolfe decomposition2007-12-20Paper
Performance ratios of the Karmarkar-Karp differencing method2007-02-14Paper
Theoretical aspects of local search.2007-01-18Paper
https://portal.mardi4nfdi.de/entity/Q57085422005-11-18Paper
https://portal.mardi4nfdi.de/entity/Q44375072003-12-02Paper
https://portal.mardi4nfdi.de/entity/Q44186832003-08-11Paper
Load balancing for redundant storage strategies: Multiprocessor scheduling with machine eligibility2003-07-27Paper
Min-max subsequence problems in multi-zone disk recording2003-07-17Paper
Fast concurrent access to parallel disks2003-06-02Paper
https://portal.mardi4nfdi.de/entity/Q27765432003-01-12Paper
https://portal.mardi4nfdi.de/entity/Q49527092000-05-10Paper
A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem.2000-02-02Paper
https://portal.mardi4nfdi.de/entity/Q43651291999-01-04Paper
Scheduling Periodic Tasks with Slack1998-11-26Paper
Scheduling Periodic Tasks1997-11-25Paper
A variable-depth search algorithm for the recursive bipartitioning of signal flow graphs1996-03-07Paper
Periodic assignment and graph colouring1994-07-31Paper
https://portal.mardi4nfdi.de/entity/Q40239421993-01-23Paper
https://portal.mardi4nfdi.de/entity/Q39947991992-09-17Paper
Boltzmann machines as a model for parallel annealing1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30351541990-01-01Paper
Boltzmann machines for travelling salesman problems1989-01-01Paper
Computations in massively parallel networks based on the Boltzmann machine: A review1989-01-01Paper

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: Jan H. M. Korst