Author of the publication

Local search for multiprocessor scheduling: how many moves does it take to a local optimum?

, and . Oper. Res. Lett., 31 (2): 137-141 (2003)

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

The Magnus-Derek game revisited., , and . Inf. Process. Lett., 109 (1): 38-40 (2008)Approximation algorithms for the test cover problem., , , , , , and . Math. Program., 98 (1-3): 477-491 (2003)Time-Indexed Formulations for Machine Scheduling Problems: Column Generation., , and . INFORMS J. Comput., 12 (2): 111-124 (2000)Timetabling problems at the TU Eindhoven., , and . Eur. J. Oper. Res., 196 (3): 877-885 (2009)Complexity and approximation of an area packing problem., , , , and . Optim. Lett., 6 (1): 1-9 (2012)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)Short Shop Schedules., , , , , , and . Oper. Res., 45 (2): 288-294 (1997)On the nearest neighbor rule for the traveling salesman problem., and . Oper. Res. Lett., 32 (1): 1-4 (2004)The Freudenthal Problem and its Ramifications (Part I)., , and . Bulletin of the EATCS, (2006)Realizing Small Tournaments Through Few Permutations., , and . Acta Cybern., 21 (2): 267-271 (2013)