Cor A. J. Hurkens

59 papers A 1B 6C 2Journal 47Unranked 3

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Fair Schedules for Single Round Robin Tournaments with Ranked Participants. CoRR Sten Wessel, Cor A. J. Hurkens, Frits C. R. Spieksma
2025	J	`jnl`	Jacques Benders and his decomposition algorithm. Oper. Res. Lett. Karen I. Aardal, Cor A. J. Hurkens, Jan Karel Lenstra
2023	J	`jnl`	Truly tight bounds for TSP heuristics. Oper. Res. Lett. Cor A. J. Hurkens
2021	J	`jnl`	Local improvement algorithms for a path packing problem: A performance analysis based on linear programming. Oper. Res. Lett. 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
2020	J	`jnl`	Column generation based heuristic for learning classification trees. Comput. Oper. Res. Murat Firat, Guillaume Crognier, Adriana F. Gabor, Cor A. J. Hurkens, Yingqian Zhang
2020	J	`jnl`	Revenue maximization in optical router nodes. Perform. Evaluation Murtuza Ali Abidini, Onno J. Boxma, Cor A. J. Hurkens, Ton Koonen, Jacques Resing
2019	—	`conf`	Revenue Maximization in an Optical Router Node Using Multiple Wavelengths. VALUETOOLS Murtuza Ali Abidini, Onno J. Boxma, Cor A. J. Hurkens, Ton Koonen, Jacques Resing
2018	J	`jnl`	Constructing classification trees using column generation. CoRR Murat Firat, Guillaume Crognier, Adriana F. Gabor, Yingqian Zhang, Cor A. J. Hurkens
2018	J	`jnl`	Integer programming models for mid-term production planning for high-tech low-volume supply chains. Eur. J. Oper. Res. Joost T. de Kruijff, Cor A. J. Hurkens, Ton G. de Kok
2018	J	`jnl`	Revenue Maximization in an Optical Router Node Using Multiple Wavelengths. CoRR Murtuza Ali Abidini, Onno J. Boxma, Cor A. J. Hurkens, Ton Koonen, Jacques Resing
2014	J	`jnl`	Stable multi-skill workforce assignments. Ann. Oper. Res. Murat Firat, Cor A. J. Hurkens, Alexandre Laugier
2013	J	`jnl`	Realizing Small Tournaments Through Few Permutations. Acta Cybern. Christian Eggermont, Cor A. J. Hurkens, Gerhard J. Woeginger
2012	J	`jnl`	An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007. Ann. Oper. Res. J. J. J. van den Broek, Cor A. J. Hurkens
2012	J	`jnl`	An improved MIP-based approach for a multi-skill workforce scheduling problem. J. Sched. Murat Firat, Cor A. J. Hurkens
2012	—	`conf`	Cinderella versus the Wicked Stepmother. IFIP TCS Marijke H. L. Bodlaender, Cor A. J. Hurkens, Vincent J. J. Kusters, Frank Staals, Gerhard J. Woeginger, Hans Zantema
2012	J	`jnl`	Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles. INFORMS J. Comput. Fabrice Talla Nobibon, Cor A. J. Hurkens, Roel Leus, Frits C. R. Spieksma
2012	J	`jnl`	Complexity and approximation of an area packing problem. Optim. Lett. Cor A. J. Hurkens, Andrea Lodi, Silvano Martello, Michele Monaci, Gerhard J. Woeginger
2012	J	`jnl`	The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number. SIAM Rev. Péter Csorba, Cor A. J. Hurkens, Gerhard J. Woeginger
2011	B	`conf`	The Cinderella Game on Holes and Anti-holes. WG Marijke H. L. Bodlaender, Cor A. J. Hurkens, Gerhard J. Woeginger
2010	C	`conf`	Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles. AAIM Fabrice Talla Nobibon, Cor A. J. Hurkens, Roel Leus, Frits C. R. Spieksma
2010	J	`jnl`	The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number. SIAM J. Discret. Math. Péter Csorba, Cor A. J. Hurkens, Gerhard J. Woeginger
2009	J	`jnl`	Incorporating the strength of MIP modeling in schedule construction. RAIRO Oper. Res. Cor A. J. Hurkens
2009	J	`jnl`	Optimal packet-to-slot assignment in mobile telecommunications. Oper. Res. Lett. Paolo Detti, Cor A. J. Hurkens, Alessandro Agnetis, Gianfranco Ciaschetti
2009	J	`jnl`	Process Discovery using Integer Linear Programming. Fundam. Informaticae Jan Martijn E. M. van der Werf, Boudewijn F. van Dongen, Cor A. J. Hurkens, Alexander Serebrenik
2009	J	`jnl`	The hardness of train rearrangements. Oper. Res. Lett. Christian Eggermont, Cor A. J. Hurkens, Maciej Modelski, Gerhard J. Woeginger
2009	J	`jnl`	Timetabling problems at the TU Eindhoven. Eur. J. Oper. Res. John van den Broek, Cor A. J. Hurkens, Gerhard J. Woeginger
2008	B	`conf`	Process Discovery Using Integer Linear Programming. Petri Nets Jan Martijn E. M. van der Werf, Boudewijn F. van Dongen, Cor A. J. Hurkens, Alexander Serebrenik
2008	A	`conf`	The Alcuin Number of a Graph. ESA Péter Csorba, Cor A. J. Hurkens, Gerhard J. Woeginger
2008	J	`jnl`	The Freudenthal Problem and its Ramifications (Part III). Bull. EATCS Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger
2008	J	`jnl`	The Magnus-Derek game revisited. Inf. Process. Lett. Cor A. J. Hurkens, Rudi Pendavingh, Gerhard J. Woeginger
2007	—	`conf`	Prefix Reversals on Binary and Ternary Strings. AB Cor A. J. Hurkens, Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, John Tromp
2007	J	`jnl`	Prefix Reversals on Binary and Ternary Strings. SIAM J. Discret. Math. Cor A. J. Hurkens, Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, John Tromp
2007	J	`jnl`	The Freudenthal Problem and its Ramifications (Part II). Bull. EATCS Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger
2007	J	`jnl`	Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks. SIAM J. Discret. Math. Cor A. J. Hurkens, J. C. M. Keijsper, Leen Stougie
2006	J	`jnl`	The Freudenthal Problem and its Ramifications (Part I). Bull. EATCS Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger
2006	C	`conf`	Timetabling Problems at the TU Eindhoven. PATAT John van den Broek, Cor A. J. Hurkens, Gerhard J. Woeginger
2006	J	`jnl`	Timetabling problems at the TU Eindhoven. Electron. Notes Discret. Math. John van den Broek, Cor A. J. Hurkens, Gerhard J. Woeginger
2005	J	`jnl`	Linear programming models with planned lead times for supply chain operations planning. Eur. J. Oper. Res. J. M. Spitter, Cor A. J. Hurkens, Ton G. de Kok, Jan Karel Lenstra, Ebbe G. Negenman
2005	J	`jnl`	Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop. INFORMS J. Comput. Ann Vandevelde, Han Hoogeveen, Cor A. J. Hurkens, Jan Karel Lenstra
2005	B	`conf`	Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks. IPCO Cor A. J. Hurkens, Judith Keijsper, Leen Stougie
2004	J	`jnl`	On the nearest neighbor rule for the traveling salesman problem. Oper. Res. Lett. Cor A. J. Hurkens, Gerhard J. Woeginger
2003	J	`jnl`	Approximation algorithms for the test cover problem. Math. Program. 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
2003	J	`jnl`	How to detect a counterfeit coin: Adaptive versus non-adaptive solutions. Inf. Process. Lett. Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger
2003	J	`jnl`	Local search for multiprocessor scheduling: how many moves does it take to a local optimum? Oper. Res. Lett. Cor A. J. Hurkens, Tjark Vredeveld
2002	J	`jnl`	Algorithms for Radio Link Frequency Assignment: The Calma Project. Oper. Res. Karen I. Aardal, Cor A. J. Hurkens, Jan Karel Lenstra, Sergey R. Tiourine
2002	J	`jnl`	Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines. INFORMS J. Comput. Tjark Vredeveld, Cor A. J. Hurkens
2000	J	`jnl`	Local search algorithms for the radio link frequency assignment problem. Telecommun. Syst. Sergey R. Tiourine, Cor A. J. Hurkens, Jan Karel Lenstra
2000	J	`jnl`	Market Split and Basis Reduction: Towards a Solution of the Cornue'jols-Dawande Instances. INFORMS J. Comput. Karen I. Aardal, Robert E. Bixby, Cor A. J. Hurkens, Arjen K. Lenstra, Job W. Smeltink
2000	J	`jnl`	Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables. Math. Oper. Res. Karen I. Aardal, Cor A. J. Hurkens, Arjen K. Lenstra
2000	J	`jnl`	Time-Indexed Formulations for Machine Scheduling Problems: Column Generation. INFORMS J. Comput. Marjan van den Akker, Cor A. J. Hurkens, Martin W. P. Savelsbergh
1999	B	`conf`	Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances. IPCO Karen I. Aardal, Robert E. Bixby, Cor A. J. Hurkens, Arjen K. Lenstra, Job W. Smeltink
1998	B	`conf`	Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables. IPCO Karen I. Aardal, Cor A. J. Hurkens, Arjen K. Lenstra
1997	J	`jnl`	Short Shop Schedules. Oper. Res. David P. Williamson, Leslie A. Hall, J. A. Hoogeveen, Cor A. J. Hurkens, Jan Karel Lenstra, Sergey Vasil'evich Sevast'janov, David B. Shmoys
1996	J	`jnl`	Approximation Algorithms for the SIAM J. Discret. Math. Olivier Goldschmidt, Dorit S. Hochbaum, Cor A. J. Hurkens, Gang Yu
1992	B	`conf`	Nasty TSP Instances for Farthest Insertion. IPCO Cor A. J. Hurkens
1991	J	`jnl`	On the diameter of the edge cover polytope. J. Comb. Theory B Cor A. J. Hurkens
1989	J	`jnl`	On fractional multicommodity flows and distance functions. Discret. Math. Cor A. J. Hurkens, Alexander Schrijver, Éva Tardos
1989	J	`jnl`	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. Cor A. J. Hurkens, Alexander Schrijver
1985	J	`jnl`	Conference Matrices from Projective Planes of Order 9. Eur. J. Comb. Cor A. J. Hurkens, J. J. Seidel