( en | de | ru )

 

Disambiguation of "Sierksma, Gerard"

Author of the publication

copydeleteadd this publication to your clipboard
Stability Aspects of the Traveling Salesman Problem Based on K-best Solutions.

, , , and . Discret. Appl. Math., 87 (1-3): 159-185 (1998)

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.

Wybe Sierksma

Gerard Meijer

Gérard Gäfgen

Gerard Spettel

Gerard Tangerding

 

Other publications of authors with the same name

Branch and peg algorithms for the simple plant location problem., , and . Comput. Oper. Res., 31 (2): 241-255 (2004)Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem., , and . WAE, volume 2141 of Lecture Notes in Computer Science, page 106-117. Springer, (2001)Introduction: Sport and Computers., , and . Eur. J. Oper. Res., 148 (2): 231-232 (2003)Stability Aspects of the Traveling Salesman Problem Based on K-best Solutions., , , and . Discret. Appl. Math., 87 (1-3): 159-185 (1998)Branch and peg algorithms for the simple plant location problem., , and . Comput. Oper. Res., 30 (7): 967-981 (2003)Faces of diameter two on the Hamiltonian cycle polytype., , and . Oper. Res. Lett., 18 (2): 59-64 (1995)Tolerance Based Algorithms for the ATSP., , and . WG, volume 3353 of Lecture Notes in Computer Science, page 222-234. Springer, (2004)Sensitivity analysis of a greedy heuristic for knapsack problems., , and . Eur. J. Oper. Res., 169 (1): 340-350 (2006)OR Practice - Training Optimization for the Decathlon., and . Operations Research, 57 (4): 812-822 (2009)Complete Local Search with Memory., and . J. Heuristics, 8 (6): 571-584 (2002)