Author of the publication

Timetabling Problems at the TU Eindhoven.

, , and . PATAT, volume 3867 of Lecture Notes in Computer Science, page 210-227. Springer, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Complexity and approximation of an area packing problem., , , , and . Optim. Lett., 6 (1): 1-9 (2012)Short Shop Schedules., , , , , , and . Oper. Res., 45 (2): 288-294 (1997)Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks., , and . IPCO, volume 3509 of Lecture Notes in Computer Science, page 407-421. Springer, (2005)On the nearest neighbor rule for the traveling salesman problem., and . Oper. Res. Lett., 32 (1): 1-4 (2004)Timetabling Problems at the TU Eindhoven., , and . PATAT, volume 3867 of Lecture Notes in Computer Science, page 210-227. Springer, (2006)Conference Matrices from Projective Planes of Order 9., and . Eur. J. Comb., 6 (1): 49-57 (1985)The Alcuin Number of a Graph., , and . ESA, volume 5193 of Lecture Notes in Computer Science, page 320-331. Springer, (2008)Approximation Algorithms for the k-Clique Covering Problem., , , and . SIAM J. Discret. Math., 9 (3): 492-509 (1996)Local search for multiprocessor scheduling: how many moves does it take to a local optimum?, and . Oper. Res. Lett., 31 (2): 137-141 (2003)Nasty TSP Instances for Farthest Insertion.. IPCO, page 346-352. Carnegie Mellon University, (1992)