| Process discovery using integer linear programming JMEM van derWerf, BF van Dongen, CAJ Hurkens, A Serebrenik Fundamenta Informaticae 94 (3-4), 387-412, 2009 | 551 | 2009 |
| On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems CAJ Hurkens, A Schrijver SIAM Journal on Discrete Mathematics 2 (1), 68-72, 1989 | 357 | 1989 |
| Time-indexed formulations for machine scheduling problems: Column generation JM Van den Akker, CAJ Hurkens, MWP Savelsbergh INFORMS Journal on Computing 12 (2), 111-124, 2000 | 331 | 2000 |
| Short shop schedules DP Williamson, LA Hall, JA Hoogeveen, CAJ Hurkens, JK Lenstra, ... Operations Research 45 (2), 288-294, 1997 | 328 | 1997 |
| An improved MIP-based approach for a multi-skill workforce scheduling problem M Fırat, CAJ Hurkens Journal of Scheduling 15 (3), 363-380, 2012 | 199 | 2012 |
| Solving a system of linear Diophantine equations with lower and upper bounds on the variables K Aardal, CAJ Hurkens, AK Lenstra Mathematics of operations research 25 (3), 427-442, 2000 | 155* | 2000 |
| Linear programming models with planned lead times for supply chain operations planning JM Spitter, CAJ Hurkens, AG De Kok, JK Lenstra, EG Negenman European Journal of operational research 163 (3), 706-720, 2005 | 135 | 2005 |
| Approximation algorithms for the test cover problem KMJ De Bontridder, BV Halldórsson, MM Halldórsson, CAJ Hurkens, ... Mathematical Programming 98 (1), 477-491, 2003 | 110 | 2003 |
| Market split and basis reduction: Towards a solution of the Cornuéjols-Dawande instances K Aardal, RE Bixby, CAJ Hurkens, AK Lenstra, JW Smeltink INFORMS Journal on Computing 12 (3), 192-202, 2000 | 104 | 2000 |
| On the nearest neighbor rule for the traveling salesman problem CAJ Hurkens, GJ Woeginger Operations Research Letters 32 (1), 1-4, 2004 | 99 | 2004 |
| Timetabling problems at the TU Eindhoven J Van den Broek, C Hurkens, G Woeginger European Journal of Operational Research 196 (3), 877-885, 2009 | 69 | 2009 |
| An overview of algorithmic approaches to frequency assignment problems SR Tiourine, CAJ Hurkens, JK Lenstra Proceedings of the CALMA Symposium on Combinatorial Algorithms for Military …, 1995 | 68 | 1995 |
| Experimental comparison of approximation algorithms for scheduling unrelated parallel machines T Vredeveld, C Hurkens INFORMS Journal on Computing 14 (2), 175-189, 2002 | 56 | 2002 |
| Column generation based heuristic for learning classification trees M Firat, G Crognier, AF Gabor, CAJ Hurkens, Y Zhang Computers & Operations Research 116, 104866, 2020 | 52* | 2020 |
| Virtual private network design: A proof of the tree routing conjecture on ring networks CAJ Hurkens, JCM Keijsper, L Stougie SIAM Journal on Discrete Mathematics 21 (2), 482-503, 2007 | 52 | 2007 |
| Local search algorithms for the radio link frequency assignment problem SR Tiourine, CAJ Hurkens, JK Lenstra Telecommunication systems 13 (2), 293-314, 2000 | 51 | 2000 |
| Blowing up convex sets in the plane CAJ Hurkens Linear Algebra and its Applications 134, 121-128, 1990 | 47 | 1990 |
| Spreading gossip efficiently CAJ Hurkens Nieuw Archief voor Wiskunde 1, 208-210, 2000 | 44 | 2000 |
| Cinderella versus the wicked stepmother MHL Bodlaender, CAJ Hurkens, VJJ Kusters, F Staals, GJ Woeginger, ... IFIP International Conference on Theoretical Computer Science, 57-71, 2012 | 43 | 2012 |
| Algorithms for frequency assignment problems KI Aardal, CAJ Hurkens, JK Lenstra, SR Tiourine CWI Quarterly 9 (1-2), 1-8, 1996 | 39 | 1996 |
