2008 |
26 | EE | Péter Csorba,
Cor A. J. Hurkens,
Gerhard J. Woeginger:
The Alcuin Number of a Graph.
ESA 2008: 320-331 |
25 | EE | 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 |
24 | EE | Cor A. J. Hurkens,
Rudi Pendavingh,
Gerhard J. Woeginger:
The Magnus-Derek game revisited.
Inf. Process. Lett. 109(1): 38-40 (2008) |
2007 |
23 | EE | 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 |
22 | EE | 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) |
21 | EE | 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) |
2006 |
20 | EE | John van den Broek,
Cor A. J. Hurkens,
Gerhard J. Woeginger:
Timetabling Problems at the TU Eindhoven.
PATAT 2006: 210-227 |
19 | EE | 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) |
2005 |
18 | EE | 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 |
17 | EE | J. M. Spitter,
Cor A. J. Hurkens,
Ton G. de Kok,
Jan Karel Lenstra,
E. G. Negenman:
Linear programming models with planned lead times for supply chain operations planning.
European Journal of Operational Research 163(3): 706-720 (2005) |
16 | EE | 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) |
2004 |
15 | EE | 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) |
2003 |
14 | EE | 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) |
13 | EE | 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) |
2002 |
12 | EE | 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) |
2000 |
11 | EE | 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) |
10 | EE | 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) |
9 | EE | 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) |
8 | | S. 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) |
1999 |
7 | EE | 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 |
1998 |
6 | EE | 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 |
1996 |
5 | EE | 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) |
1992 |
4 | | Cor A. J. Hurkens:
Nasty TSP Instances for Farthest Insertion.
IPCO 1992: 346-352 |
1991 |
3 | EE | Cor A. J. Hurkens:
On the diameter of the edge cover polytope.
J. Comb. Theory, Ser. B 51(2): 271-276 (1991) |
1989 |
2 | EE | Cor A. J. Hurkens,
Alexander Schrijver,
Éva Tardos:
On fractional multicommodity flows and distance functions.
Discrete Mathematics 73(1-2): 99-109 (1989) |
1 | | 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) |