default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCor A. J. Hurkens
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j43]Cor A. J. Hurkens:
Truly tight bounds for TSP heuristics. Oper. Res. Lett. 51(4): 425-431 (2023)- 2021
- [j42]Koen M. J. De Bontridder
, Bjarni V. Halldórsson, Magnús M. Halldórsson, Cor A. J. Hurkens, Jan Karel Lenstra, R. Ravi, Leen Stougie:
Local improvement algorithms for a path packing problem: A performance analysis based on linear programming. Oper. Res. Lett. 49(1): 62-68 (2021) - 2020
- [j41]Murat Firat, Guillaume Crognier, Adriana F. Gabor, Cor A. J. Hurkens, Yingqian Zhang:
Column generation based heuristic for learning classification trees. Comput. Oper. Res. 116: 104866 (2020) - [j40]Murtuza Ali Abidini, Onno J. Boxma, Cor A. J. Hurkens, Ton Koonen, Jacques Resing:
Revenue maximization in optical router nodes. Perform. Evaluation 140-141: 102108 (2020)
2010 – 2019
- 2019
- [c12]Murtuza Ali Abidini, Onno J. Boxma, Cor A. J. Hurkens, Ton Koonen, Jacques Resing:
Revenue Maximization in an Optical Router Node Using Multiple Wavelengths. VALUETOOLS 2019: 47-53 - 2018
- [j39]Joost T. de Kruijff, Cor A. J. Hurkens, Ton G. de Kok:
Integer programming models for mid-term production planning for high-tech low-volume supply chains. Eur. J. Oper. Res. 269(3): 984-997 (2018) - [i2]Murtuza Ali Abidini, Onno J. Boxma, Cor A. J. Hurkens, Ton Koonen, Jacques Resing:
Revenue Maximization in an Optical Router Node Using Multiple Wavelengths. CoRR abs/1809.07860 (2018) - [i1]Murat Firat, Guillaume Crognier, Adriana F. Gabor, Yingqian Zhang, Cor A. J. Hurkens:
Constructing classification trees using column generation. CoRR abs/1810.06684 (2018) - 2014
- [j38]Murat Firat, Cor A. J. Hurkens, Alexandre Laugier:
Stable multi-skill workforce assignments. Ann. Oper. Res. 213(1): 95-114 (2014) - 2013
- [j37]Christian Eggermont, Cor A. J. Hurkens, Gerhard J. Woeginger:
Realizing Small Tournaments Through Few Permutations. Acta Cybern. 21(2): 267-271 (2013) - 2012
- [j36]J. J. J. van den Broek, Cor A. J. Hurkens:
An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007. Ann. Oper. Res. 194(1): 439-454 (2012) - [j35]Fabrice Talla Nobibon, Cor A. J. Hurkens, Roel Leus, Frits C. R. Spieksma:
Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles. INFORMS J. Comput. 24(3): 485-499 (2012) - [j34]Cor A. J. Hurkens, Andrea Lodi, Silvano Martello, Michele Monaci, Gerhard J. Woeginger:
Complexity and approximation of an area packing problem. Optim. Lett. 6(1): 1-9 (2012) - [j33]Murat Firat, Cor A. J. Hurkens:
An improved MIP-based approach for a multi-skill workforce scheduling problem. J. Sched. 15(3): 363-380 (2012) - [j32]Péter Csorba, Cor A. J. Hurkens, Gerhard J. Woeginger:
The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number. SIAM Rev. 54(1): 141-154 (2012) - [c11]Marijke H. L. Bodlaender, Cor A. J. Hurkens, Vincent J. J. Kusters, Frank Staals, Gerhard J. Woeginger, Hans Zantema:
Cinderella versus the Wicked Stepmother. IFIP TCS 2012: 57-71 - 2011
- [c10]Marijke H. L. Bodlaender, Cor A. J. Hurkens, Gerhard J. Woeginger:
The Cinderella Game on Holes and Anti-holes. WG 2011: 71-82 - 2010
- [j31]Péter Csorba, Cor A. J. Hurkens, Gerhard J. Woeginger:
The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number. SIAM J. Discret. Math. 24(3): 757-769 (2010) - [c9]Fabrice Talla Nobibon, Cor A. J. Hurkens, Roel Leus, Frits C. R. Spieksma:
Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles. AAIM 2010: 229-242
2000 – 2009
- 2009
- [j30]John van den Broek, Cor A. J. Hurkens, Gerhard J. Woeginger:
Timetabling problems at the TU Eindhoven. Eur. J. Oper. Res. 196(3): 877-885 (2009) - [j29]Jan Martijn E. M. van der Werf, Boudewijn F. van Dongen, Cor A. J. Hurkens, Alexander Serebrenik:
Process Discovery using Integer Linear Programming. Fundam. Informaticae 94(3-4): 387-412 (2009) - [j28]Christian Eggermont, Cor A. J. Hurkens, Maciej Modelski, Gerhard J. Woeginger:
The hardness of train rearrangements. Oper. Res. Lett. 37(2): 80-82 (2009) - [j27]Paolo Detti, Cor A. J. Hurkens, Alessandro Agnetis, Gianfranco Ciaschetti:
Optimal packet-to-slot assignment in mobile telecommunications. Oper. Res. Lett. 37(4): 261-264 (2009) - [j26]Cor A. J. Hurkens:
Incorporating the strength of MIP modeling in schedule construction. RAIRO Oper. Res. 43(4): 409-420 (2009) - 2008
- [j25]Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger:
The Freudenthal Problem and its Ramifications (Part III). Bull. EATCS 95: 201-219 (2008) - [j24]Cor A. J. Hurkens, Rudi Pendavingh, Gerhard J. Woeginger:
The Magnus-Derek game revisited. Inf. Process. Lett. 109(1): 38-40 (2008) - [c8]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 - [c7]Péter Csorba, Cor A. J. Hurkens, Gerhard J. Woeginger:
The Alcuin Number of a Graph. ESA 2008: 320-331 - 2007
- [j23]Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger:
The Freudenthal Problem and its Ramifications (Part II). Bull. EATCS 91: 189-204 (2007) - [j22]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. Discret. Math. 21(2): 482-503 (2007) - [j21]Cor A. J. Hurkens, Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, John Tromp:
Prefix Reversals on Binary and Ternary Strings. SIAM J. Discret. Math. 21(3): 592-611 (2007) - [c6]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 - 2006
- [j20]Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger:
The Freudenthal Problem and its Ramifications (Part I). Bull. EATCS 90: 175-191 (2006) - [j19]John van den Broek, Cor A. J. Hurkens, Gerhard J. Woeginger:
Timetabling problems at the TU Eindhoven. Electron. Notes Discret. Math. 25: 27-28 (2006) - [c5]John van den Broek, Cor A. J. Hurkens, Gerhard J. Woeginger:
Timetabling Problems at the TU Eindhoven. PATAT 2006: 210-227 - 2005
- [j18]J. M. Spitter, Cor A. J. Hurkens, Ton G. de Kok, Jan Karel Lenstra, Ebbe G. Negenman:
Linear programming models with planned lead times for supply chain operations planning. Eur. J. Oper. Res. 163(3): 706-720 (2005) - [j17]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 J. Comput. 17(3): 305-320 (2005) - [c4]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 - 2004
- [j16]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
- [j15]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) - [j14]Koen M. J. De Bontridder, Bjarni V. Halldórsson, Magnús M. Halldórsson, Cor A. J. Hurkens, Jan Karel Lenstra, R. Ravi, Leen Stougie:
Approximation algorithms for the test cover problem. Math. Program. 98(1-3): 477-491 (2003) - [j13]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
- [j12]Tjark Vredeveld, Cor A. J. Hurkens:
Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines. INFORMS J. Comput. 14(2): 175-189 (2002) - [j11]Karen I. Aardal, Cor A. J. Hurkens, Jan Karel Lenstra, Sergey R. Tiourine:
Algorithms for Radio Link Frequency Assignment: The Calma Project. Oper. Res. 50(6): 968-980 (2002) - 2000
- [j10]Marjan van den Akker, Cor A. J. Hurkens, Martin W. P. Savelsbergh:
Time-Indexed Formulations for Machine Scheduling Problems: Column Generation. INFORMS J. Comput. 12(2): 111-124 (2000) - [j9]Karen I. 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 J. Comput. 12(3): 192-202 (2000) - [j8]Karen I. 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) - [j7]Sergey R. Tiourine, Cor A. J. Hurkens, Jan Karel Lenstra:
Local search algorithms for the radio link frequency assignment problem. Telecommun. Syst. 13(2-4): 293-314 (2000)
1990 – 1999
- 1999
- [c3]Karen I. 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
- [c2]Karen I. 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 - 1997
- [j6]David P. Williamson, Leslie A. Hall, J. A. Hoogeveen, Cor A. J. Hurkens, Jan Karel Lenstra, Sergey Vasil'evich Sevast'janov, David B. Shmoys:
Short Shop Schedules. Oper. Res. 45(2): 288-294 (1997) - 1996
- [j5]Olivier Goldschmidt, Dorit S. Hochbaum, Cor A. J. Hurkens, Gang Yu:
Approximation Algorithms for the k-Clique Covering Problem. SIAM J. Discret. Math. 9(3): 492-509 (1996) - 1992
- [c1]Cor A. J. Hurkens:
Nasty TSP Instances for Farthest Insertion. IPCO 1992: 346-352 - 1991
- [j4]Cor A. J. Hurkens:
On the diameter of the edge cover polytope. J. Comb. Theory B 51(2): 271-276 (1991)
1980 – 1989
- 1989
- [j3]Cor A. J. Hurkens, Alexander Schrijver, Éva Tardos:
On fractional multicommodity flows and distance functions. Discret. Math. 73(1-2): 99-109 (1989) - [j2]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. Discret. Math. 2(1): 68-72 (1989) - 1985
- [j1]Cor A. J. Hurkens, J. J. Seidel:
Conference Matrices from Projective Planes of Order 9. Eur. J. Comb. 6(1): 49-57 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
