Cor A. J. Hurkens
Eindhoven University of Technology
75 Papers
449 Citations
Cor A. J. Hurkens is an academic researcher from Eindhoven University of Technology. The author has contributed to research in topics: Integer programming & Approximation algorithm. The author has an hindex of 23, co-authored 73 publications. Previous affiliations of Cor A. J. Hurkens include Tilburg University.
Chat about Author
Papers
Process Discovery using Integer Linear Programming
J. M. E. M. van derWerf,B. F. van Dongen,Cor A. J. Hurkens,Alexander Serebrenik +3 more
- 01 Aug 2009
TL;DR: In this paper, the authors present a process discovery algorithm using concepts taken from the language-based theory of regions, a well-known Petri net research area and identify a number of shortcomings of this theory from the process discovery perspective, and provide solutions based on integer linear programming.
Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
TL;DR: This paper discusses how Dantzig-Wolfe decomposition techniques can be applied to alleviate, at least partly, the difficulties associated with the size of time-indexed formulations, and shows that the application of these techniques still allows the use of cut generation techniques.
224
An improved MIP-based approach for a multi-skill workforce scheduling problem
Murat Firat,Cor A. J. Hurkens +1 more
TL;DR: This paper deals with scheduling complex tasks with an inhomogeneous set of resources by repeated application of a flexible matching model that selects tasks to be processed and forms groups of technicians assigned to combinations of tasks.
On the nearest neighbor rule for the traveling salesman problem
TL;DR: This work constructed families of TSP instances with n cities for which the nearest neighbor rule yields a tour-length that is a factor @W(logn) above the length of the optimal tour.
83
Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances
Karen Aardal,Robert E. Bixby,Cor A. J. Hurkens,Arjen K. Lenstra,Job W. Smeltink +4 more
- 09 Jun 1999
TL;DR: This study uses the algorithm of Aardal, Hurkens, and Lenstra (1998) based on lattice basis reduction as a general method for solving systems of linear diophantine equations with bounds on the variables for market split instances.