Cor A. J. Hurkens

J. J. J. van den Broek, Cor A. J. Hurkens: An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007. Annals OR 194(1): 439-454 (2012)

Fabrice Talla Nobibon, Cor A. J. Hurkens, Roel Leus, Frits C. R. Spieksma: Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles. INFORMS Journal on Computing 24(3): 485-499 (2012)

Cor A. J. Hurkens, Andrea Lodi, Silvano Martello, Michele Monaci, Gerhard J. Woeginger: Complexity and approximation of an area packing problem. Optimization Letters 6(1): 1-9 (2012)

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 Review 54(1): 141-154 (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: 57-71

Marijke H. L. Bodlaender, Cor A. J. Hurkens, Gerhard J. Woeginger: The Cinderella Game on Holes and Anti-holes. WG 2011: 71-82

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. Discrete Math. 24(3): 757-769 (2010)

Fabrice Talla Nobibon, Cor A. J. Hurkens, Roel Leus, Frits C. R. Spieksma: Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles. AAIM 2010: 229-242

John van den Broek, Cor A. J. Hurkens, Gerhard J. Woeginger: Timetabling problems at the TU Eindhoven. European Journal of Operational Research 196(3): 877-885 (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. Inform. 94(3-4): 387-412 (2009)

Christian Eggermont, Cor A. J. Hurkens, Maciej Modelski, Gerhard J. Woeginger: The hardness of train rearrangements. Oper. Res. Lett. 37(2): 80-82 (2009)

Paolo Detti, Cor A. J. Hurkens, Alessandro Agnetis, Gianfranco Ciaschetti: Optimal packet-to-slot assignment in mobile telecommunications. Oper. Res. Lett. 37(4): 261-264 (2009)

Cor A. J. Hurkens: Incorporating the strength of MIP modeling in schedule construction. RAIRO - Operations Research 43(4): 409-420 (2009)

Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger: The Freudenthal Problem and its Ramifications (Part III). Bulletin of the EATCS 95: 201-219 (2008)

Cor A. J. Hurkens, Rudi Pendavingh, Gerhard J. Woeginger: The Magnus-Derek game revisited. Inf. Process. Lett. 109(1): 38-40 (2008)

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: 368-387

Péter Csorba, Cor A. J. Hurkens, Gerhard J. Woeginger: The Alcuin Number of a Graph. ESA 2008: 320-331

Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger: The Freudenthal Problem and its Ramifications (Part II). Bulletin of the EATCS 91: 189-204 (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. Discrete Math. 21(2): 482-503 (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. Discrete Math. 21(3): 592-611 (2007)

Cor A. J. Hurkens, Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, John Tromp: Prefix Reversals on Binary and Ternary Strings. AB 2007: 292-306

Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger: The Freudenthal Problem and its Ramifications (Part I). Bulletin of the EATCS 90: 175-191 (2006)

John van den Broek, Cor A. J. Hurkens, Gerhard J. Woeginger: Timetabling problems at the TU Eindhoven. Electronic Notes in Discrete Mathematics 25: 27-28 (2006)

John van den Broek, Cor A. J. Hurkens, Gerhard J. Woeginger: Timetabling Problems at the TU Eindhoven. PATAT 2006: 210-227

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. European Journal of Operational Research 163(3): 706-720 (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 Journal on Computing 17(3): 305-320 (2005)

Cor A. J. Hurkens, Judith Keijsper, Leen Stougie: Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks. IPCO 2005: 407-421

Cor A. J. Hurkens, Gerhard J. Woeginger: On the nearest neighbor rule for the traveling salesman problem. Oper. Res. Lett. 32(1): 1-4 (2004)

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): 137-141 (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): 477-491 (2003)

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): 137-141 (2003)

Tjark Vredeveld, Cor A. J. Hurkens: Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines. INFORMS Journal on Computing 14(2): 175-189 (2002)

Karen Aardal, Cor A. J. Hurkens, Jan Karel Lenstra, Sergey R. Tiourine: Algorithms for Radio Link Frequency Assignment: The Calma Project. Operations Research 50(6): 968-980 (2002)

Marjan van den Akker, Cor A. J. Hurkens, Martin W. P. Savelsbergh: Time-Indexed Formulations for Machine Scheduling Problems: Column Generation. INFORMS Journal on Computing 12(2): 111-124 (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 Journal on Computing 12(3): 192-202 (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): 427-442 (2000)

Sergey R. Tiourine, Cor A. J. Hurkens, Jan Karel Lenstra: Local search algorithms for the radio link frequency assignment problem. Telecommunication Systems 13(2-4): 293-314 (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: 1-16

Karen Aardal, Cor A. J. Hurkens, Arjen K. Lenstra: Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables. IPCO 1998: 229-242

Olivier Goldschmidt, Dorit S. Hochbaum, Cor A. J. Hurkens, Gang Yu: Approximation Algorithms for the k-Clique Covering Problem. SIAM J. Discrete Math. 9(3): 492-509 (1996)

Cor A. J. Hurkens: Nasty TSP Instances for Farthest Insertion. IPCO 1992: 346-352

Cor A. J. Hurkens: On the diameter of the edge cover polytope. J. Comb. Theory, Ser. B 51(2): 271-276 (1991)

Cor A. J. Hurkens, Alexander Schrijver, Éva Tardos: On fractional multicommodity flows and distance functions. Discrete Mathematics 73(1-2): 99-109 (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. Discrete Math. 2(1): 68-72 (1989)