Cor Hurkens bibliography

  1. Cor A. J. Hurkens and Gerhard J. Woeginger.
    On the nearest neighbor rule for the traveling salesman problem.
    Oper. Res. Lett., 32(1):1--4, 2004.
  2. K. M. J. de Bontridder, B. V. Halld{\'o}rsson, M. M. Halld{\'o}rsson, C. A. J. Hurkens, J. K. Lenstra, R. Ravi, and L. Stougie.
    Approximation algorithms for the test cover problem.
    Math. Program., 98(1-3, Ser. B):477--491, 2003.
    Integer programming (Pittsburgh, PA, 2002).
  3. Axel Born, Cor A. J. Hurkens, and Gerhard J. Woeginger.
    How to detect a counterfeit coin: adaptive versus non-adaptive solutions.
    Inform. Process. Lett., 86(3):137--141, 2003.
  4. C. A. J. Hurkens and T. Vredeveld.
    Local search for multiprocessor scheduling: how many moves does it take to a local optimum?
    Oper. Res. Lett., 31(2):137--141, 2003.
  5. Rachel Brouwer, Thijs Brouwer, Cor Hurkens, Martijn van Manen, Carolynne Montijn, Jan Schreuder, and J. F. Williams.
    Magma design automation: component placement on chips; the ``holey cheese'' problem.
    In Proceedings of the Forty-Second European Study Group with Industry (Amsterdam, 2002), volume 51 of CWI Syllabi, pages 77--90, Amsterdam, 2002. Math. Centrum Centrum Wisk. Inform.
  6. Karen Aardal, Cor Hurkens, Jan Karel Lenstra, and Sergey Tiourine.
    Algorithms for radio link frequency assignment: the {CALMA} project.
    Oper. Res., 50(6):968--980, 2002.
  7. Tjark Vredeveld and Cor Hurkens.
    Experimental comparison of approximation algorithms for scheduling unrelated parallel machines.
    INFORMS J. Comput., 14(2):175--189, 2002.
  8. Karen Aardal, Cor A. J. Hurkens, and Arjen K. Lenstra.
    Solving a system of linear {D}iophantine equations with lower and upper bounds on the variables.
    Math. Oper. Res., 25(3):427--442, 2000.
  9. Emile Aarts, Cor Hurkens, and Jan Karel Lenstra.
    Whizzkids: two exercises in computational discrete optimization.
    In ICIAM 99 (Edinburgh), pages 141--152. Oxford Univ. Press, Oxford, 2000.
  10. C. A. J. Hurkens.
    Spreading gossip efficiently.
    Nieuw Arch. Wiskd. (5), 1(2):208--210, 2000.
  11. K. Aardal, R. E. Bixby, C. A. J. Hurkens, A. K. Lenstra, and J. W. Smeltink.
    Market split and basis reduction: towards a solution of the {C}ornu\'ejols-{D}awande instances.
    INFORMS J. Comput., 12(3):192--202, 2000.
  12. J. M. van den Akker, C. A. J. Hurkens, and M. W. P. Savelsbergh.
    Time-indexed formulations for machine scheduling problems: column generation.
    INFORMS J. Comput., 12(2):111--124, 2000.
  13. Karen Aardal, Robert E. Bixby, Cor A. J. Hurkens, Arjen K. Lenstra, and Job W. Smeltink.
    Market split and basis reduction: towards a solution of the {C}ornu\'ejols-{D}awande instances.
    In Integer programming and combinatorial optimization (Graz, 1999), volume 1610 of Lecture Notes in Comput. Sci., pages 1--16. Springer, Berlin, 1999.
  14. Karen Aardal, Cor Hurkens, and Arjen K. Lenstra.
    Solving a linear {D}iophantine equation with lower and upper bounds on the variables.
    In {\em Integer programming and combinatorial optimization (Houston, TX, 1998)}, volume 1412 of Lecture Notes in Comput. Sci., pages 229--242. Springer, Berlin, 1998.
  15. D. P. Williamson, L. A. Hall, J. A. Hoogeveen, C. A. J. Hurkens, J. K. Lenstra, S. V. Sevast{\cprime}janov, and D. B. Shmoys.
    Short shop schedules.
    Oper. Res., 45(2):288--294, 1997.
  16. Zhiping Chen, C. A. J. Hurkens, and J. L. de Jong.
    A branch-and-price algorithm for solving the cutting strips problem.
    Appl. Math. J. Chinese Univ. Ser. B, 12(2):215--224, 1997.
    A Chinese summary appears in Gaoxiao Yingyong Shuxue Xuebao Ser. A 12 (1997), no. 2, 252.
  17. Oliver Goldschmidt, Dorit S. Hochbaum, Cor Hurkens, and Gang Yu.
    Approximation algorithms for the k-clique covering problem.
    SIAM J. Discrete Math., 9(3):492--509, 1996.
  18. A. J. C. Hurkens, C. A. J. Hurkens, and R. W. Whitty.
    On generation of a class of flowgraphs.
    In Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity (Prachatice, 1990), volume 51 of Ann. Discrete Math., pages 107--112. North-Holland, Amsterdam, 1992.
  19. C. A. J. Hurkens.
    On the diameter of the edge cover polytope.
    J. Combin. Theory Ser. B, 51(2):271--276, 1991.
  20. C. A. J. Hurkens.
    Blowing up convex sets in the plane.
    Linear Algebra Appl., 134:121--128, 1990.
  21. C. A. J. Hurkens.
    On the existence of an integral potential in a weighted bidirected graph.
    Linear Algebra Appl., 114/115:541--553, 1989.
  22. C. A. J. Hurkens and A. 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.
  23. C. A. J. Hurkens, A. Schrijver, and {\'E}. Tardos.
    On fractional multicommodity flows and distance functions.
    In Proceedings of the Oberwolfach Meeting ``Kombinatorik'' (1986), volume 73, pages 99--109, 1989.
  24. C. A. J. Hurkens, L. Lov{\'a}sz, A. Schrijver, and {\'E}. Tardos.
    How to tidy up your set-system?
    In Combinatorics (Eger, 1987), volume 52 of Colloq. Math. Soc. J\'anos Bolyai, pages 309--314. North-Holland, Amsterdam, 1988.
  25. C. A. J. Hurkens.
    On the diameter of the b-matching polytope.
    In Combinatorics (Eger, 1987), volume 52 of Colloq. Math. Soc. J\'anos Bolyai, pages 301--307. North-Holland, Amsterdam, 1988.
  26. C. A. J. Hurkens and J. J. Seidel.
    Conference matrices from projective planes of order 9.
    European J. Combin., 6(1):49--57, 1985.