Cor A. J. Hurkens

Orcid: 0000-0002-5132-6751

According to our database1, Cor A. J. Hurkens authored at least 50 papers between 1985 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Truly tight bounds for TSP heuristics.
Oper. Res. Lett., July, 2023

2021
Local improvement algorithms for a path packing problem: A performance analysis based on linear programming.
Oper. Res. Lett., 2021

2020
Revenue maximization in optical router nodes.
Perform. Evaluation, 2020

Column generation based heuristic for learning classification trees.
Comput. Oper. Res., 2020

2019
Revenue Maximization in an Optical Router Node Using Multiple Wavelengths.
Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools, 2019

2018
Integer programming models for mid-term production planning for high-tech low-volume supply chains.
Eur. J. Oper. Res., 2018

Constructing classification trees using column generation.
CoRR, 2018

2014
Stable multi-skill workforce assignments.
Ann. Oper. Res., 2014

2013
Realizing Small Tournaments Through Few Permutations.
Acta Cybern., 2013

2012
The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number.
SIAM Rev., 2012

An improved MIP-based approach for a multi-skill workforce scheduling problem.
J. Sched., 2012

Complexity and approximation of an area packing problem.
Optim. Lett., 2012

Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles.
INFORMS J. Comput., 2012

An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007.
Ann. Oper. Res., 2012

Cinderella versus the Wicked Stepmother.
Proceedings of the Theoretical Computer Science, 2012

2011
The Cinderella Game on Holes and Anti-holes.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

2010
Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles.
Proceedings of the Algorithmic Aspects in Information and Management, 2010

2009
Incorporating the strength of MIP modeling in schedule construction.
RAIRO Oper. Res., 2009

The hardness of train rearrangements.
Oper. Res. Lett., 2009

Optimal packet-to-slot assignment in mobile telecommunications.
Oper. Res. Lett., 2009

Process Discovery using Integer Linear Programming.
Fundam. Informaticae, 2009

Timetabling problems at the TU Eindhoven.
Eur. J. Oper. Res., 2009

2008
The Magnus-Derek game revisited.
Inf. Process. Lett., 2008

The Freudenthal Problem and its Ramifications (Part III).
Bull. EATCS, 2008

The Alcuin Number of a Graph.
Proceedings of the Algorithms, 2008

2007
Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks.
SIAM J. Discret. Math., 2007

Prefix Reversals on Binary and Ternary Strings.
SIAM J. Discret. Math., 2007

The Freudenthal Problem and its Ramifications (Part II).
Bull. EATCS, 2007

2006
The Freudenthal Problem and its Ramifications (Part I).
Bull. EATCS, 2006

2005
Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop.
INFORMS J. Comput., 2005

Linear programming models with planned lead times for supply chain operations planning.
Eur. J. Oper. Res., 2005

2004
On the nearest neighbor rule for the traveling salesman problem.
Oper. Res. Lett., 2004

2003
Local search for multiprocessor scheduling: how many moves does it take to a local optimum?
Oper. Res. Lett., 2003

Approximation algorithms for the test cover problem.
Math. Program., 2003

How to detect a counterfeit coin: Adaptive versus non-adaptive solutions.
Inf. Process. Lett., 2003

2002
Algorithms for Radio Link Frequency Assignment: The Calma Project.
Oper. Res., 2002

Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines.
INFORMS J. Comput., 2002

2000
Local search algorithms for the radio link frequency assignment problem.
Telecommun. Syst., 2000

Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables.
Math. Oper. Res., 2000

Time-Indexed Formulations for Machine Scheduling Problems: Column Generation.
INFORMS J. Comput., 2000

Market Split and Basis Reduction: Towards a Solution of the Cornue'jols-Dawande Instances.
INFORMS J. Comput., 2000

1999
Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances.
Proceedings of the Integer Programming and Combinatorial Optimization, 1999

1998
Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables.
Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1997
Short Shop Schedules.
Oper. Res., 1997

1996
Approximation Algorithms for the <i>k</i>-Clique Covering Problem.
SIAM J. Discret. Math., 1996

1992
Nasty TSP Instances for Farthest Insertion.
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

1991
On the diameter of the edge cover polytope.
J. Comb. Theory B, 1991

1989
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., 1989

On fractional multicommodity flows and distance functions.
Discret. Math., 1989

1985
Conference Matrices from Projective Planes of Order 9.
Eur. J. Comb., 1985


  Loading...