( en | de | ru )

 

Disambiguation of "Sierksma, Gerard"

Author of the publication

copydeleteadd this publication to your clipboard
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)

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 Spettel

Gerard Tangerding

Walter Gérard

Kaethe Gerard

 

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)The composition of semi-finished inventories at a solid board plant., , and . Eur. J. Oper. Res., 155 (1): 96-111 (2004)Solving the k-best traveling salesman problem., , , and . Comput. Oper. Res., 26 (4): 409-425 (1999)Tolerance-based Branch and Bound algorithms for the ATSP., , , and . Eur. J. Oper. Res., 189 (3): 775-788 (2008)Equivalent instances of the simple plant location problem., , and . Comput. Math. Appl., 57 (5): 812-820 (2009)The Skeleton of the Symmetric Traveling Salesman Polytope.. Discret. Appl. Math., 43 (1): 63-74 (1993)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)Simplex Adjacency Graphs in Linear Optimization., and . Algorithmic Oper. Res., (2006)Stability Aspects of the Traveling Salesman Problem Based on K-best Solutions., , , and . Discret. Appl. Math., 87 (1-3): 159-185 (1998)Partial monotonizations of Hamiltonian cycle polytopes: dimensions and diameters., and . Discret. Appl. Math., 105 (1-3): 173-182 (2000)