Cor A. J. Hurkens

Publication Activity (10 Years)

Years Active: 1985-2023
Publications (10 Years): 8

Top Topics

Integer Programming

Travelling Salesman

Greedy Heuristics

Top Venues

Oper. Res. Lett.

Ann. Oper. Res.

Publications

Cor A. J. Hurkens
Truly tight bounds for TSP heuristics. Oper. Res. Lett. 51 (4) (2023)
Koen M. J. De Bontridder, Bjarni V. Halldórsson, Magnús M. Halldórsson, Cor A. J. Hurkens, Jan Karel Lenstra, R. Ravi, Leen Stougie
Local improvement algorithms for a path packing problem: A performance analysis based on linear programming. Oper. Res. Lett. 49 (1) (2021)
Murtuza Ali Abidini, Onno J. Boxma, Cor A. J. Hurkens, Ton Koonen, Jacques Resing
Revenue maximization in optical router nodes. Perform. Evaluation (2020)
Murat Firat, Guillaume Crognier, Adriana F. Gabor, Cor A. J. Hurkens, Yingqian Zhang
Column generation based heuristic for learning classification trees. Comput. Oper. Res. 116 (2020)
Murtuza Ali Abidini, Onno J. Boxma, Cor A. J. Hurkens, Ton Koonen, Jacques Resing
Revenue Maximization in an Optical Router Node Using Multiple Wavelengths. VALUETOOLS (2019)
Joost T. de Kruijff, Cor A. J. Hurkens, Ton G. de Kok
Integer programming models for mid-term production planning for high-tech low-volume supply chains. Eur. J. Oper. Res. 269 (3) (2018)
Murat Firat, Guillaume Crognier, Adriana F. Gabor, Yingqian Zhang, Cor A. J. Hurkens
Constructing classification trees using column generation. CoRR (2018)
Murtuza Ali Abidini, Onno J. Boxma, Cor A. J. Hurkens, Ton Koonen, Jacques Resing
Revenue Maximization in an Optical Router Node Using Multiple Wavelengths. CoRR (2018)
Murat Firat, Cor A. J. Hurkens, Alexandre Laugier
Stable multi-skill workforce assignments. Ann. Oper. Res. 213 (1) (2014)
Christian Eggermont, Cor A. J. Hurkens, Gerhard J. Woeginger
Realizing Small Tournaments Through Few Permutations. Acta Cybern. 21 (2) (2013)
Péter Csorba, Cor A. J. Hurkens, Gerhard J. Woeginger
The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number. SIAM Rev. 54 (1) (2012)
Marijke H. L. Bodlaender, Cor A. J. Hurkens, Vincent J. J. Kusters, Frank Staals, Gerhard J. Woeginger, Hans Zantema
Cinderella versus the Wicked Stepmother. IFIP TCS (2012)
Fabrice Talla Nobibon, Cor A. J. Hurkens, Roel Leus, Frits C. R. Spieksma
Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles. INFORMS J. Comput. 24 (3) (2012)
Murat Firat, Cor A. J. Hurkens
An improved MIP-based approach for a multi-skill workforce scheduling problem. J. Sched. 15 (3) (2012)
J. J. J. van den Broek, Cor A. J. Hurkens
An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007. Ann. Oper. Res. 194 (1) (2012)
Cor A. J. Hurkens, Andrea Lodi, Silvano Martello, Michele Monaci, Gerhard J. Woeginger
Complexity and approximation of an area packing problem. Optim. Lett. 6 (1) (2012)
Marijke H. L. Bodlaender, Cor A. J. Hurkens, Gerhard J. Woeginger
The Cinderella Game on Holes and Anti-holes. WG (2011)
Fabrice Talla Nobibon, Cor A. J. Hurkens, Roel Leus, Frits C. R. Spieksma
Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles. AAIM (2010)
Péter Csorba, Cor A. J. Hurkens, Gerhard J. Woeginger
The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number. SIAM J. Discret. Math. 24 (3) (2010)
John van den Broek, Cor A. J. Hurkens, Gerhard J. Woeginger
Timetabling problems at the TU Eindhoven. Eur. J. Oper. Res. 196 (3) (2009)
Cor A. J. Hurkens
Incorporating the strength of MIP modeling in schedule construction. RAIRO Oper. Res. 43 (4) (2009)
Jan Martijn E. M. van der Werf, Boudewijn F. van Dongen, Cor A. J. Hurkens, Alexander Serebrenik
Process Discovery using Integer Linear Programming. Fundam. Informaticae 94 (3-4) (2009)
Paolo Detti, Cor A. J. Hurkens, Alessandro Agnetis, Gianfranco Ciaschetti
Optimal packet-to-slot assignment in mobile telecommunications. Oper. Res. Lett. 37 (4) (2009)
Christian Eggermont, Cor A. J. Hurkens, Maciej Modelski, Gerhard J. Woeginger
The hardness of train rearrangements. Oper. Res. Lett. 37 (2) (2009)
Jan Martijn E. M. van der Werf, Boudewijn F. van Dongen, Cor A. J. Hurkens, Alexander Serebrenik
Process Discovery Using Integer Linear Programming. Petri Nets (2008)
Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger
The Freudenthal Problem and its Ramifications (Part III). Bull. EATCS 95 (2008)
Cor A. J. Hurkens, Rudi Pendavingh, Gerhard J. Woeginger
The Magnus-Derek game revisited. Inf. Process. Lett. 109 (1) (2008)
Péter Csorba, Cor A. J. Hurkens, Gerhard J. Woeginger
The Alcuin Number of a Graph. ESA (2008)
Cor A. J. Hurkens, Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, John Tromp
Prefix Reversals on Binary and Ternary Strings. AB (2007)
Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger
The Freudenthal Problem and its Ramifications (Part II). Bull. EATCS 91 (2007)
Cor A. J. Hurkens, J. C. M. Keijsper, Leen Stougie
Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks. SIAM J. Discret. Math. 21 (2) (2007)
Cor A. J. Hurkens, Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, John Tromp
Prefix Reversals on Binary and Ternary Strings. SIAM J. Discret. Math. 21 (3) (2007)
John van den Broek, Cor A. J. Hurkens, Gerhard J. Woeginger
Timetabling Problems at the TU Eindhoven. PATAT (2006)
Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger
The Freudenthal Problem and its Ramifications (Part I). Bull. EATCS 90 (2006)
John van den Broek, Cor A. J. Hurkens, Gerhard J. Woeginger
Timetabling problems at the TU Eindhoven. Electron. Notes Discret. Math. 25 (2006)
Cor A. J. Hurkens, Judith Keijsper, Leen Stougie
Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks. IPCO (2005)
J. M. Spitter, Cor A. J. Hurkens, Ton G. de Kok, Jan Karel Lenstra, Ebbe G. Negenman
Linear programming models with planned lead times for supply chain operations planning. Eur. J. Oper. Res. 163 (3) (2005)
Ann Vandevelde, Han Hoogeveen, Cor A. J. Hurkens, Jan Karel Lenstra
Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop. INFORMS J. Comput. 17 (3) (2005)
Cor A. J. Hurkens, Gerhard J. Woeginger
On the nearest neighbor rule for the traveling salesman problem. Oper. Res. Lett. 32 (1) (2004)
Cor A. J. Hurkens, Tjark Vredeveld
Local search for multiprocessor scheduling: how many moves does it take to a local optimum? Oper. Res. Lett. 31 (2) (2003)
Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger
How to detect a counterfeit coin: Adaptive versus non-adaptive solutions. Inf. Process. Lett. 86 (3) (2003)
Koen M. J. De Bontridder, Bjarni V. Halldórsson, Magnús M. Halldórsson, Cor A. J. Hurkens, Jan Karel Lenstra, R. Ravi, Leen Stougie
Approximation algorithms for the test cover problem. Math. Program. 98 (1-3) (2003)
Karen Aardal, Cor A. J. Hurkens, Jan Karel Lenstra, Sergey R. Tiourine
Algorithms for Radio Link Frequency Assignment: The Calma Project. Oper. Res. 50 (6) (2002)
Tjark Vredeveld, Cor A. J. Hurkens
Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines. INFORMS J. Comput. 14 (2) (2002)
Marjan van den Akker, Cor A. J. Hurkens, Martin W. P. Savelsbergh
Time-Indexed Formulations for Machine Scheduling Problems: Column Generation. INFORMS J. Comput. 12 (2) (2000)
Karen Aardal, Robert E. Bixby, Cor A. J. Hurkens, Arjen K. Lenstra, Job W. Smeltink
Market Split and Basis Reduction: Towards a Solution of the Cornue'jols-Dawande Instances. INFORMS J. Comput. 12 (3) (2000)
Sergey R. Tiourine, Cor A. J. Hurkens, Jan Karel Lenstra
Local search algorithms for the radio link frequency assignment problem. Telecommun. Syst. 13 (2-4) (2000)
Karen Aardal, Cor A. J. Hurkens, Arjen K. Lenstra
Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables. Math. Oper. Res. 25 (3) (2000)
Karen Aardal, Robert E. Bixby, Cor A. J. Hurkens, Arjen K. Lenstra, Job W. Smeltink
Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances. IPCO (1999)
Karen Aardal, Cor A. J. Hurkens, Arjen K. Lenstra
Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables. IPCO (1998)
David P. Williamson, Leslie A. Hall, J. A. Hoogeveen, Cor A. J. Hurkens, Jan Karel Lenstra, Sergey Vasil'evich Sevast'janov, David B. Shmoys
Short Shop Schedules. Oper. Res. 45 (2) (1997)
Olivier Goldschmidt, Dorit S. Hochbaum, Cor A. J. Hurkens, Gang Yu
-Clique Covering Problem. SIAM J. Discret. Math. 9 (3) (1996)
Cor A. J. Hurkens
Nasty TSP Instances for Farthest Insertion. IPCO (1992)
Cor A. J. Hurkens
On the diameter of the edge cover polytope. J. Comb. Theory, Ser. B 51 (2) (1991)
Cor A. J. Hurkens, Alexander Schrijver, Éva Tardos
On fractional multicommodity flows and distance functions. Discret. Math. 73 (1-2) (1989)
Cor A. J. Hurkens, Alexander Schrijver
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. SIAM J. Discret. Math. 2 (1) (1989)
Cor A. J. Hurkens, J. J. Seidel
Conference Matrices from Projective Planes of Order 9. Eur. J. Comb. 6 (1) (1985)