Conference Matrices from Projective Planes of Order 9. - Cor A. J. Hurkens; J. J. Seidel (Eur. J. Comb., 1985)

On fractional multicommodity flows and distance functions. - Cor A. J. Hurkens; Alexander Schrijver; Éva Tardos (Discret. Math., 1989)

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. - Cor A. J. Hurkens; Alexander Schrijver (SIAM J. Discret. Math., 1989)

On the diameter of the edge cover polytope. - Cor A. J. Hurkens (J. Comb. Theory B, 1991)

Nasty TSP Instances for Farthest Insertion. - Cor A. J. Hurkens (IPCO, 1992)

Approximation Algorithms for the k-Clique Covering Problem. - Olivier Goldschmidt; Dorit S. Hochbaum; Cor A. J. Hurkens; Gang Yu 001 (SIAM J. Discret. Math., 1996)

Short Shop Schedules. - David P. Williamson; Leslie A. Hall; J. A. Hoogeveen; Cor A. J. Hurkens; Jan Karel Lenstra; Sergey Vasil'evich Sevast'janov; David B. Shmoys (Oper. Res., 1997)

Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables. - Karen I. Aardal; Cor A. J. Hurkens; Arjen K. Lenstra (IPCO, 1998)

Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances. - Karen I. Aardal; Robert E. Bixby; Cor A. J. Hurkens; Arjen K. Lenstra; Job W. Smeltink (IPCO, 1999)

Market Split and Basis Reduction: Towards a Solution of the Cornue'jols-Dawande Instances. - Karen I. Aardal; Robert E. Bixby; Cor A. J. Hurkens; Arjen K. Lenstra; Job W. Smeltink (INFORMS J. Comput., 2000)

Time-Indexed Formulations for Machine Scheduling Problems: Column Generation. - Marjan van den Akker 001; Cor A. J. Hurkens; Martin W. P. Savelsbergh (INFORMS J. Comput., 2000)

Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables. - Karen I. Aardal; Cor A. J. Hurkens; Arjen K. Lenstra (Math. Oper. Res., 2000)

Local search algorithms for the radio link frequency assignment problem. - Sergey R. Tiourine; Cor A. J. Hurkens; Jan Karel Lenstra (Telecommun. Syst., 2000)

Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines. - Tjark Vredeveld; Cor A. J. Hurkens (INFORMS J. Comput., 2002)

Algorithms for Radio Link Frequency Assignment: The Calma Project. - Karen I. Aardal; Cor A. J. Hurkens; Jan Karel Lenstra; Sergey R. Tiourine (Oper. Res., 2002)

How to detect a counterfeit coin: Adaptive versus non-adaptive solutions. - Axel Born; Cor A. J. Hurkens; Gerhard J. Woeginger (Inf. Process. Lett., 2003)

Approximation algorithms for the test cover problem. - Koen M. J. De Bontridder; Bjarni V. Halldórsson; Magnús M. Halldórsson; Cor A. J. Hurkens; Jan Karel Lenstra; R. Ravi 001; Leen Stougie (Math. Program., 2003)

Local search for multiprocessor scheduling: how many moves does it take to a local optimum? - Cor A. J. Hurkens; Tjark Vredeveld (Oper. Res. Lett., 2003)

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

Linear programming models with planned lead times for supply chain operations planning. - J. M. Spitter; Cor A. J. Hurkens; Ton G. de Kok; Jan Karel Lenstra; Ebbe G. Negenman (Eur. J. Oper. Res., 2005)

Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop. - Ann Vandevelde; Han Hoogeveen; Cor A. J. Hurkens; Jan Karel Lenstra (INFORMS J. Comput., 2005)

The Freudenthal Problem and its Ramifications (Part I). - Axel Born; Cor A. J. Hurkens; Gerhard J. Woeginger (Bull. EATCS, 2006)

The Freudenthal Problem and its Ramifications (Part II). - Axel Born; Cor A. J. Hurkens; Gerhard J. Woeginger (Bull. EATCS, 2007)

Prefix Reversals on Binary and Ternary Strings. - Cor A. J. Hurkens; Leo van Iersel; Judith Keijsper; Steven Kelk; Leen Stougie; John Tromp (SIAM J. Discret. Math., 2007)

Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks. - Cor A. J. Hurkens; J. C. M. Keijsper; Leen Stougie (SIAM J. Discret. Math., 2007)

The Alcuin Number of a Graph. - Péter Csorba; Cor A. J. Hurkens; Gerhard J. Woeginger (ESA, 2008)

The Freudenthal Problem and its Ramifications (Part III). - Axel Born; Cor A. J. Hurkens; Gerhard J. Woeginger (Bull. EATCS, 2008)

The Magnus-Derek game revisited. - Cor A. J. Hurkens; Rudi Pendavingh; Gerhard J. Woeginger (Inf. Process. Lett., 2008)

Timetabling problems at the TU Eindhoven. - John van den Broek; Cor A. J. Hurkens; Gerhard J. Woeginger (Eur. J. Oper. Res., 2009)

Process Discovery using Integer Linear Programming. - Jan Martijn E. M. van der Werf; Boudewijn F. van Dongen; Cor A. J. Hurkens; Alexander Serebrenik (Fundam. Informaticae, 2009)

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

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

Incorporating the strength of MIP modeling in schedule construction. - Cor A. J. Hurkens (RAIRO Oper. Res., 2009)

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

The Cinderella Game on Holes and Anti-holes. - Marijke H. L. Bodlaender; Cor A. J. Hurkens; Gerhard J. Woeginger (WG, 2011)

Cinderella versus the Wicked Stepmother. - Marijke H. L. Bodlaender; Cor A. J. Hurkens; Vincent J. J. Kusters; Frank Staals; Gerhard J. Woeginger; Hans Zantema (IFIP TCS, 2012)

An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007. - J. J. J. van den Broek; Cor A. J. Hurkens (Ann. Oper. Res., 2012)

Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles. - Fabrice Talla Nobibon; Cor A. J. Hurkens; Roel Leus; Frits C. R. Spieksma (INFORMS J. Comput., 2012)

Complexity and approximation of an area packing problem. - Cor A. J. Hurkens; Andrea Lodi 001; Silvano Martello; Michele Monaci; Gerhard J. Woeginger (Optim. Lett., 2012)

An improved MIP-based approach for a multi-skill workforce scheduling problem. - Murat Firat; Cor A. J. Hurkens (J. Sched., 2012)

The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number. - Péter Csorba; Cor A. J. Hurkens; Gerhard J. Woeginger (SIAM Rev., 2012)

Realizing Small Tournaments Through Few Permutations. - Christian Eggermont; Cor A. J. Hurkens; Gerhard J. Woeginger (Acta Cybern., 2013)

Stable multi-skill workforce assignments. - Murat Firat; Cor A. J. Hurkens; Alexandre Laugier (Ann. Oper. Res., 2014)

Constructing classification trees using column generation. - Murat Firat; Guillaume Crognier; Adriana F. Gabor; Yingqian Zhang 001; Cor A. J. Hurkens (CoRR, 2018)

Integer programming models for mid-term production planning for high-tech low-volume supply chains. - Joost T. de Kruijff; Cor A. J. Hurkens; Ton G. de Kok (Eur. J. Oper. Res., 2018)

Revenue Maximization in an Optical Router Node Using Multiple Wavelengths. - Murtuza Ali Abidini; Onno J. Boxma; Cor A. J. Hurkens; Ton Koonen; Jacques Resing (VALUETOOLS, 2019)

Column generation based heuristic for learning classification trees. - Murat Firat; Guillaume Crognier; Adriana F. Gabor; Cor A. J. Hurkens; Yingqian Zhang 001 (Comput. Oper. Res., 2020)

Revenue maximization in optical router nodes. - Murtuza Ali Abidini; Onno J. Boxma; Cor A. J. Hurkens; Ton Koonen; Jacques Resing (Perform. Evaluation, 2020)

Local improvement algorithms for a path packing problem: A performance analysis based on linear programming. - Koen M. J. De Bontridder; Bjarni V. Halldórsson; Magnús M. Halldórsson; Cor A. J. Hurkens; Jan Karel Lenstra; R. Ravi 001; Leen Stougie (Oper. Res. Lett., 2021)

Truly tight bounds for TSP heuristics. - Cor A. J. Hurkens (Oper. Res. Lett., 2023)

Fair Schedules for Single Round Robin Tournaments with Ranked Participants. - Sten Wessel; Cor A. J. Hurkens; Frits C. R. Spieksma (CoRR, 2025)