From post

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.

 

Другие публикации лиц с тем же именем

Complexity and approximation of an area packing problem., , , , и . Optim. Lett., 6 (1): 1-9 (2012)Short Shop Schedules., , , , , , и . Oper. Res., 45 (2): 288-294 (1997)Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks., , и . IPCO, том 3509 из Lecture Notes in Computer Science, стр. 407-421. Springer, (2005)On the nearest neighbor rule for the traveling salesman problem., и . Oper. Res. Lett., 32 (1): 1-4 (2004)Timetabling Problems at the TU Eindhoven., , и . PATAT, том 3867 из Lecture Notes in Computer Science, стр. 210-227. Springer, (2006)Conference Matrices from Projective Planes of Order 9., и . Eur. J. Comb., 6 (1): 49-57 (1985)The Alcuin Number of a Graph., , и . ESA, том 5193 из Lecture Notes in Computer Science, стр. 320-331. Springer, (2008)Approximation Algorithms for the k-Clique Covering Problem., , , и . SIAM J. Discret. Math., 9 (3): 492-509 (1996)Prefix Reversals on Binary and Ternary Strings., , , , , и . SIAM J. Discret. Math., 21 (3): 592-611 (2007)Nasty TSP Instances for Farthest Insertion.. IPCO, стр. 346-352. Carnegie Mellon University, (1992)