The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Cor A. J. Hurkens: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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. [Citation Graph (0, 0)][DBLP]
    IPCO, 1999, pp:1-16 [Conf]
  2. Karen Aardal, Cor A. J. Hurkens, Arjen K. Lenstra
    Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables. [Citation Graph (0, 0)][DBLP]
    IPCO, 1998, pp:229-242 [Conf]
  3. Cor A. J. Hurkens
    Nasty TSP Instances for Farthest Insertion. [Citation Graph (0, 0)][DBLP]
    IPCO, 1992, pp:346-352 [Conf]
  4. Cor A. J. Hurkens, Judith Keijsper, Leen Stougie
    Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:407-421 [Conf]
  5. 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. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2000, v:12, n:3, pp:192-202 [Journal]
  6. Marjan van den Akker, Cor A. J. Hurkens, Martin W. P. Savelsbergh
    Time-Indexed Formulations for Machine Scheduling Problems: Column Generation. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2000, v:12, n:2, pp:111-124 [Journal]
  7. 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. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2005, v:17, n:3, pp:305-320 [Journal]
  8. Tjark Vredeveld, Cor A. J. Hurkens
    Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2002, v:14, n:2, pp:175-189 [Journal]
  9. Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger
    How to detect a counterfeit coin: Adaptive versus non-adaptive solutions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:86, n:3, pp:137-141 [Journal]
  10. Cor A. J. Hurkens
    On the diameter of the edge cover polytope. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:51, n:2, pp:271-276 [Journal]
  11. Karen Aardal, Cor A. J. Hurkens, Arjen K. Lenstra
    Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2000, v:25, n:3, pp:427-442 [Journal]
  12. Cor A. J. Hurkens, Tjark Vredeveld
    Local search for multiprocessor scheduling: how many moves does it take to a local optimum? [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:2, pp:137-141 [Journal]
  13. Cor A. J. Hurkens, Gerhard J. Woeginger
    On the nearest neighbor rule for the traveling salesman problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:1, pp:1-4 [Journal]
  14. Olivier Goldschmidt, Dorit S. Hochbaum, Cor A. J. Hurkens, Gang Yu
    Approximation Algorithms for the k-Clique Covering Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1996, v:9, n:3, pp:492-509 [Journal]
  15. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:1, pp:68-72 [Journal]
  16. S. R. Tiourine, Cor A. J. Hurkens, Jan Karel Lenstra
    Local search algorithms for the radio link frequency assignment problem. [Citation Graph (0, 0)][DBLP]
    Telecommunication Systems, 2000, v:13, n:2-4, pp:293-314 [Journal]
  17. 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. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:163, n:3, pp:706-720 [Journal]
  18. Cor A. J. Hurkens, Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, John Tromp
    Prefix Reversals on Binary and Ternary Strings. [Citation Graph (0, 0)][DBLP]
    AB, 2007, pp:292-306 [Conf]
  19. Cor A. J. Hurkens, Alexander Schrijver, Éva Tardos
    On fractional multicommodity flows and distance functions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:73, n:1-2, pp:99-109 [Journal]

  20. Process Discovery Using Integer Linear Programming. [Citation Graph (, )][DBLP]


  21. The Alcuin Number of a Graph. [Citation Graph (, )][DBLP]


  22. Timetabling Problems at the TU Eindhoven. [Citation Graph (, )][DBLP]


Search in 0.020secs, Finished in 0.021secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002