default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Kolonko
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j14]Michael Kolonko, Feng Gu, Zijun Wu:
Improving the statistical quality of random number generators by applying a simple ratio transformation. Math. Comput. Simul. 157: 130-142 (2019)- [j13]Björn Görder, Michael Kolonko:
Ranking and Selection: A New Sequential Bayesian Procedure for Use with Common Random Numbers. ACM Trans. Model. Comput. Simul. 29(1): 2:1-2:24 (2019) - 2017
- [j12]Zijun Wu
, Michael Kolonko, Rolf H. Möhring:
Stochastic Runtime Analysis of the Cross-Entropy Algorithm. IEEE Trans. Evol. Comput. 21(4): 616-628 (2017) - 2014
- [j11]Zijun Wu, Michael Kolonko:
Asymptotic Properties of a Generalized Cross-Entropy Optimization Algorithm. IEEE Trans. Evol. Comput. 18(5): 658-673 (2014) - 2007
- [j10]Nicole Bäuerle, O. Engelhardt-Funke, Michael Kolonko:
On the waiting time of arriving aircrafts and the capacity of airports with one or two runways. Eur. J. Oper. Res. 177(2): 1180-1196 (2007) - 2006
- [j9]Michael Kolonko, D. Wäsch:
Sequential reservoir sampling with a nonuniform distribution. ACM Trans. Math. Softw. 32(2): 257-273 (2006) - 1999
- [j8]Michael Kolonko:
Some new results on simulated annealing applied to the job shop scheduling problem. Eur. J. Oper. Res. 113(1): 123-136 (1999) - 1998
- [j7]Stefan Voget, Michael Kolonko:
Multidimensional Optimization with a Fuzzy Genetic Algorithm. J. Heuristics 4(3): 221-244 (1998) - 1995
- [j6]Michael Kolonko:
A Generalized Crossover Operation for Genetic Algorithms. Complex Syst. 9(3) (1995) - 1993
- [j5]Michael Kolonko:
Optimal compactification of a floorplan and its relation to other optimization problems-a dynamic programming approach. ZOR Methods Model. Oper. Res. 37(1): 75-95 (1993) - 1992
- [j4]Michael Kolonko:
Book review. ZOR Methods Model. Oper. Res. 36(4): 378 (1992) - 1987
- [j3]Harald Benzing, Michael Kolonko:
Structured Policies for a Sequential Design Problem with General Distributions. Math. Oper. Res. 12(1): 60-71 (1987) - 1985
- [j2]Michael Kolonko, Harald Benzing:
The Sequential Design of Bernoulli Experiments Including Switching Costs. Oper. Res. 33(2): 412-426 (1985) - 1983
- [j1]Michael Kolonko:
Bounds for the regret loss in dynamic programming under adaptive control. Z. Oper. Research 27(1): 17-37 (1983)
Conference and Workshop Papers
- 2017
- [c3]Feng Gu, Zhixing Yang, Michael Kolonko, Thorsten Grosch:
Interactive Visualization of Gaps and Overlaps for Large and Dynamic Sphere Packings. VMV 2017: 103-110 - 2014
- [c2]Zijun Wu, Michael Kolonko:
Absorption in model-based search algorithms for combinatorial optimization. IEEE Congress on Evolutionary Computation 2014: 1744-1751 - 2001
- [c1]Henning Behnke, Michael Kolonko, Ulrich Mertins, Stefan Schnitter:
Optimization and Simulation: Sequential Packing of Flexible Objects Using Evolutionary Algorithms. SAGA 2001: 145-154
Informal and Other Publications
- 2016
- [i1]Michael Kolonko, Zijun Wu, Feng Gu:
Improving the Quality of Random Number Generators by Applying a Simple Ratio Transformation. CoRR abs/1612.07318 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
