C. Hurkens

发表

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

Alexander Schrijver, Cor A. J. Hurkens, A. Schrijver, 1989, SIAM J. Discret. Math..

Market Split and Basis Reduction: Towards a Solution of the Cornue'jols-Dawande Instances

Arjen K. Lenstra, Karen Aardal, Robert E. Bixby, 2000, INFORMS J. Comput..

Linear programming models with planned lead times for supply chain operations planning

Jan Karel Lenstra, Cor A. J. Hurkens, Ton G. de Kok, 2005, Eur. J. Oper. Res..

A branch-and-price algorithm for solving the cutting strips problem

C. Hurkens, Chen Zhiping, J. L. Jong, 1997 .

How to tidy up your set-system?

Éva Tardos, László Lovász, Cor A. J. Hurkens, 1988 .

An improved MIP-based combinatorial approach for a multi-skill workforce scheduling problem

C. Hurkens, M. Firat, 2011 .

Combinatorial algorithms in bioinformatics

Alexander Schrijver, Monique Laurent, Paul M. B. Vitányi, 2004 .

Timetabling problems at the TU Eindhoven

G. Woeginger, C. Hurkens, J. V. D. Broek, 2006, Eur. J. Oper. Res..

The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number

Gerhard J. Woeginger, Péter Csorba, Cor A. J. Hurkens, 2010, SIAM Rev..

The Alcuin Number of a Graph

Gerhard J. Woeginger, Péter Csorba, Cor A. J. Hurkens, 2008, ESA.

Makespan minimization for chemical batch processes using non-uniform time grids

Rainer E. Burkard, Cor A. J. Hurkens, Tiziana Fortuna, 2002 .

Integer programming models for mid-term production planning for high-tech low-volume supply chains

Cor A. J. Hurkens, Ton G. de Kok, Joost T. de Kruijff, 2018, Eur. J. Oper. Res..

An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007

Cor A. J. Hurkens, J. J. J. van den Broek, C. Hurkens, 2012, Ann. Oper. Res..

Process Discovery using Integer Linear Programming

Boudewijn F. van Dongen, Jan Martijn E. M. van der Werf, Alexander Serebrenik, 2009, Fundam. Informaticae.

Approximation algorithms for the test cover problem

R. Ravi, Jan Karel Lenstra, Leen Stougie, 2003, Math. Program..

Short Shop Schedules

Han Hoogeveen, Jan Karel Lenstra, David P. Williamson, 1997, Oper. Res..

Fast movement strategies for a step‐and‐scan wafer stepper

Caj Cor Hurkens, C. Hurkens, Jbm Hans Melissen, 1997 .

The Cinderella Game on Holes and Anti-holes

Gerhard J. Woeginger, Cor A. J. Hurkens, Marijke H. L. Bodlaender, 2011, WG.

New techniques in geometric and discrete optimization

Cornelius Antonius Josephus Hurkens, C. Hurkens, 1989 .

On the nearest neighbor rule for the traveling salesman problem

Gerhard J. Woeginger, Cor A. J. Hurkens, G. Woeginger, 2004, Oper. Res. Lett..

Algorithms for Radio Link Frequency Assignment: The Calma Project

Jan Karel Lenstra, Karen Aardal, Cor A. J. Hurkens, 2002, Oper. Res..

Process Discovery using Integer Linear Programming

Boudewijn F. van Dongen, Jan Martijn E. M. van der Werf, Alexander Serebrenik, 2009, Fundamenta Informaticae.

On fractional multicommodity flows and distance functions

Alexander Schrijver, Éva Tardos, Cor A. J. Hurkens, 1989, Discret. Math..

Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles

Frits C. R. Spieksma, Fabrice Talla Nobibon, Roel Leus, 2012, INFORMS J. Comput..

Time-Indexed Formulations for Machine Scheduling Problems: Column Generation

Martin W. P. Savelsbergh, Marjan van den Akker, Cor A. J. Hurkens, 2000, INFORMS J. Comput..

Market Split and Basis Reduction: Towards a Solution of the Cornue'jols-Dawande Instances

Arjen K. Lenstra, Karen Aardal, Robert E. Bixby, 1999, INFORMS J. Comput..

How Cinderella Won the Bucket Game (and Lived Happily Ever After)

Gerhard J. Woeginger, Cor A. J. Hurkens, G. Woeginger, 2011 .

Column generation based math-heuristic for classification trees

Yingqian Zhang, Cor A. J. Hurkens, Guillaume Crognier, 2018 .

Column generation based heuristic for learning classification trees

Yingqian Zhang, Murat Firat, Guillaume Crognier, 2020, Comput. Oper. Res..

An improved MIP-based approach for a multi-skill workforce scheduling problem

C. Hurkens, M. Firat, 2012, J. Sched..

An improved MIP-based combinatorial approach for a multi-skill workforce scheduling problem

C. Hurkens, M. Firat, 2011 .

Stable multi-skill workforce assignments

Murat Firat, Alexandre Laugier, Cor A. J. Hurkens, 2014, Ann. Oper. Res..

Incorporating the strength of MIP modeling in schedule construction

Cor A. J. Hurkens, C. Hurkens, 2009, RAIRO Oper. Res..

Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines

Tjark Vredeveld, Cor A. J. Hurkens, C. Hurkens, 2002, INFORMS J. Comput..

A Time-Indexed Formulation for Single-Machine Scheduling Problems: Branch-and-Cut

Martin W. P. Savelsbergh, Cor A. J. Hurkens, M. Savelsbergh, 1996 .

Cinderella versus the Wicked Stepmother

Gerhard J. Woeginger, Hans Zantema, Frank Staals, 2012, IFIP TCS.

Coloring Graphs While Avoiding Monochromatic Cycles

Frits C. R. Spieksma, Roel Leus, Cor A. J. Hurkens, 2010 .

Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles

Frits C. R. Spieksma, Fabrice Talla Nobibon, Roel Leus, 2010, AAIM.

Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables

Arjen K. Lenstra, Karen Aardal, Cor A. J. Hurkens, 2000, Math. Oper. Res..

Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables

Arjen K. Lenstra, Karen Aardal, Cor A. J. Hurkens, 1998, IPCO.

Revenue maximization in optical router nodes

A. M. J. Koonen, Onno J. Boxma, Cor A. J. Hurkens, 2020, Perform. Evaluation.

Revenue Maximization in an Optical Router Node Using Multiple Wavelengths

A. M. J. Koonen, Onno J. Boxma, Jacques Resing, 2018, VALUETOOLS.

Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks

Judith Keijsper, Leen Stougie, Cor A. J. Hurkens, 2005, SIAM J. Discret. Math..