( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
MIPLIB 2010.

, , , , , , , , , , , , , , , и . Math. Program. Comput., 3 (2): 103-163 (2011)

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.

Linda Bixby

Robert E Lewis

Robert E Verhine

Robert E Kass

Robert E Kass

 

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

TSP Cuts Which Do Not Conform to the Template Paradigm., , , и . Computational Combinatorial Optimization, том 2241 из Lecture Notes in Computer Science, стр. 261-304. Springer, (2001)Converting Linear Programs to Network Problems., и . Math. Oper. Res., 5 (3): 321-357 (1980)Finding a small 3-connected minor maintaining a fixed minor and a fixed element., и . Combinatorica, 7 (3): 231-242 (1987)An Almost Linear-Time Algorithm for Graph Realization., и . Math. Oper. Res., 13 (1): 99-123 (1988)MIP: Theory and Practice - Closing the Gap., , , , и . System Modelling and Optimization, том 174 из IFIP Conference Proceedings, стр. 19-50. Kluwer, (1999)Solving Real-World Linear Programs: A Decade and More of Progress.. Operations Research, 50 (1): 3-15 (2002)Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods., , , , и . Operations Research, 40 (5): 885-897 (1992)Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances., , , , и . IPCO, том 1610 из Lecture Notes in Computer Science, стр. 1-16. Springer, (1999)Kuratowski's and Wagner's theorems for matroids.. J. Comb. Theory B, 22 (1): 31-53 (1977)Cutting planes and the traveling salesman problem (abstract only)., , , и . SODA, стр. 429. ACM/SIAM, (2000)