( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the nearest neighbor rule for the traveling salesman problem.

, и . Oper. Res. Lett., 32 (1): 1-4 (2004)

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.

Gerhard J Gröbner

Gerhard J Fraune

Heinrich J J Mieschendahl

Norbert J J Bock

J J M Ramakers

 

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

How to detect a counterfeit coin: Adaptive versus non-adaptive solutions., , и . Inf. Process. Lett., 86 (3): 137-141 (2003)Nothing New about Equiangular Polygons.. The American Mathematical Monthly, 120 (9): 849-850 (2013)Competitive Odds and Ends., и . Online Algorithms, том 1442 из Lecture Notes in Computer Science, стр. 385-394. Springer, (1996)Minimum Cost Dynamic Flows: The Series-Parallel Case., и . IPCO, том 920 из Lecture Notes in Computer Science, стр. 329-343. Springer, (1995)The Travelling Salesman and the PQ-Tree., , и . IPCO, том 1084 из Lecture Notes in Computer Science, стр. 490-504. Springer, (1996)On the Approximability of Average Completion Time Scheduling under Precedence Constraints.. ICALP, том 2076 из Lecture Notes in Computer Science, стр. 887-897. Springer, (2001)An FPTAS for Agreeably Weighted Variance on a Single Machine.. ICALP, том 1644 из Lecture Notes in Computer Science, стр. 707-716. Springer, (1999)Sometimes Travelling is Easy: The Master Tour Problem., , и . ESA, том 979 из Lecture Notes in Computer Science, стр. 128-141. Springer, (1995)An Approximation Scheme for Cake Division with a Linear Number of Cuts.. ESA, том 2461 из Lecture Notes in Computer Science, стр. 896-901. Springer, (2002)Getting the Best Response for Your Erg., , и . SWAT, том 3111 из Lecture Notes in Computer Science, стр. 14-25. Springer, (2004)