Jan Korst - Concepedia

Author

Jan Korst

Also Known As

Aarts, Emile, J. H. M. Korst, J. Korst, J.H.M. Korst, Jan H. M. Korst, Jan H.M Korst, Jan H.M. Korst, Jan Korst, Korst, Jan, Korst, Jan H. M.

118

Publications

1.8K

Citations

H-Index

Concepts

All Affiliations

Philips (Netherlands)Eindhoven University of Technology NXP (Netherlands)Philips (Finland)Centrum Wiskunde & Informatica

About

Jan Korst is an author at Philips (Netherlands) specializing in engineering, combinatorial optimization, and computer science.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	15	18	895
2	Computer Science	12	13	610
3	Computer Engineering	8	8	225
4	Business	2	2	47
5	Data Science	1	1	24

Jan Korst

Publications

Citations

H-Index

Page 1

	Year	Citations
Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing. Michael Mascagni, Emile Aart, Jan Korst Mathematics of Computation Artificial IntelligenceEvolving Neural NetworkEngineeringSimulated AnnealingNeural Computing	1990	188
A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem Emile Aarts, Jan Korst, Peter J. M. van Laarhoven Journal of Statistical Physics Mathematical ProgrammingEngineeringSimulated AnnealingQuantitative AnalysisTraveling Salesman Problem	1988	129
Boltzmann machines for travelling salesman problems Emile Aarts, Jan Korst European Journal of Operational Research Mathematical ProgrammingComputational ScienceEngineeringTraveling Salesman ProblemCombinatorial Problem	1989	95
Algorithm 864 Silvano Martello, David Pisinger, Daniele Vigo, ACM Transactions on Mathematical Software Mathematical ProgrammingMinimum NumberGeneral Orthogonal PackingsEngineeringRectangular-shaped Boxes	2007	92
Combinatorial optimization on a Boltzmann machine Jan Korst, Emile Aarts Journal of Parallel and Distributed Computing Mathematical ProgrammingEngineeringOptimization ProblemCombinatorial ProblemComputational Complexity	1989	73
Improved force-directed scheduling in high-throughput digital signal processing Wim Verhaegh, P.E.R. Lippens, Emile Aarts, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems EngineeringReal-time System DesignComputer ArchitectureHardware SystemsImproved Force-directed Scheduling	1995	59
Random duplicated assignment Jan Korst	1997	44
Improved force-directed scheduling Wim Verhaegh, Emile Aarts, Jan Korst, European Design Automation Conference Force-directed SchedulingEngineeringProject SchedulingScheduling ProblemScheduling Analysis	1991	37
Scheduling Periodic Tasks Jan Korst, Emile Aarts, Jan Karel Lenstra INFORMS journal on computing Mathematical ProgrammingEngineeringComputational ComplexityIntelligent SystemsPolynomial Time	1996	32
Boltzmann machines as a model for parallel annealing Emile Aarts, Jan Korst Algorithmica EngineeringSimulated AnnealingEntropyParallel Complexity TheoryComputer Engineering	1991	28

Page 1