Person:975520: Difference between revisions

From MaRDI portal
Person:975520
Created automatically from import230922100950
 
m AuthorDisambiguator moved page Cor A. J. Hurkens to Cor A. J. Hurkens: Duplicate
 
(One intermediate revision by the same user not shown)
(No difference)

Latest revision as of 16:37, 12 December 2023

Available identifiers

zbMath Open hurkens.cor-a-jMaRDI QIDQ975520

List of research outcomes

PublicationDate of PublicationType
Truly tight bounds for TSP heuristics2023-09-12Paper
Local improvement algorithms for a path packing problem: a performance analysis based on linear programming2021-04-07Paper
Column generation based heuristic for learning classification trees2020-01-27Paper
Integer programming models for mid-term production planning for high-tech low-volume supply chains2018-05-17Paper
Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles2016-06-29Paper
Stable multi-skill workforce assignments2014-09-26Paper
Realizing Small Tournaments Through Few Permutations2014-05-05Paper
An improved MIP-based approach for a multi-skill workforce scheduling problem2014-02-05Paper
Complexity and approximation of an area packing problem2012-11-30Paper
An IP-based heuristic for the post enrolment course timetabling problem of the ITC20072012-11-15Paper
Cinderella versus the Wicked Stepmother2012-09-21Paper
Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop2012-06-08Paper
Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines2012-05-30Paper
The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number2012-04-05Paper
The Cinderella Game on Holes and Anti-holes2011-12-16Paper
How Cinderella Won the Bucket Game (and Lived Happily Ever After)2011-12-07Paper
A REVERSIBLE ERLANG LOSS SYSTEM WITH MULTITYPE CUSTOMERS AND MULTITYPE SERVERS2011-08-17Paper
The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number2011-06-17Paper
Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles2010-07-20Paper
The c game revisited2010-06-09Paper
Timetabling problems at the TU Eindhoven2009-12-07Paper
Process Discovery using Integer Linear Programming2009-11-30Paper
Incorporating the strength of MIP modeling in schedule construction2009-11-12Paper
https://portal.mardi4nfdi.de/entity/Q33965992009-09-19Paper
https://portal.mardi4nfdi.de/entity/Q33966092009-09-19Paper
https://portal.mardi4nfdi.de/entity/Q33966412009-09-19Paper
Optimal packet-to-slot assignment in mobile telecommunications2009-08-14Paper
Algorithms for Radio Link Frequency Assignment: The Calma Project2009-07-03Paper
The hardness of train rearrangements2009-05-07Paper
How to detect a counterfeit coin: Adaptive versus non-adaptive solutions2009-03-23Paper
The Alcuin Number of a Graph2008-11-25Paper
Prefix Reversals on Binary and Ternary Strings2008-08-13Paper
Process Discovery Using Integer Linear Programming2008-07-03Paper
Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks2008-05-22Paper
Prefix Reversals on Binary and Ternary Strings2007-11-29Paper
Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks2007-08-30Paper
Timetabling problems at the TU Eindhoven2007-05-29Paper
Linear programming models with planned lead times for supply chain operations planning2005-02-09Paper
On the nearest neighbor rule for the traveling salesman problem2004-07-01Paper
Approximation algorithms for the test cover problem2004-03-11Paper
Local search for multiprocessor scheduling: how many moves does it take to a local optimum?2003-11-17Paper
Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances2003-10-28Paper
https://portal.mardi4nfdi.de/entity/Q27600802003-07-15Paper
Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables2001-11-26Paper
Local search algorithms for the radio link frequency assignment problem2000-01-01Paper
Time-Indexed Formulations for Machine Scheduling Problems: Column Generation2000-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42636981999-09-22Paper
https://portal.mardi4nfdi.de/entity/Q38403621998-08-10Paper
Short Shop Schedules1998-07-06Paper
Fast movement strategies for a step‐and‐scan wafer stepper1997-11-25Paper
A branch-and-price algorithm for solving the cutting strips problem1997-08-28Paper
https://portal.mardi4nfdi.de/entity/Q31274251997-04-09Paper
Approximation Algorithms for the k-Clique Covering Problem1997-02-26Paper
https://portal.mardi4nfdi.de/entity/Q40271601993-02-21Paper
https://portal.mardi4nfdi.de/entity/Q39774261992-06-25Paper
On the diameter of the edge cover polytope1991-01-01Paper
Blowing up convex sets in the plane1990-01-01Paper
On the existence of an integral potential in a weighted bidirected graph1989-01-01Paper
On fractional multicommodity flows and distance functions1989-01-01Paper
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 Problems1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32113411988-01-01Paper
Conference matrices from projective planes of order 91985-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Cor A. J. Hurkens