( en | de | ru )

 

Disambiguation of "Cook, William J."

Author of the publication

copydeleteadd this publication to your clipboard
On the Complexity of Branch and Cut Methods for the Traveling Salesman Problem.

, and . Polyhedral Combinatorics, volume 1 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 75-82. DIMACS/AMS, (1990)

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.

William J Godinez

Stephen Cook

Ralph Cook

Andrew Cook

Neil Cook

 

Other publications of authors with the same name

Fifty-Plus Years of Combinatorial Integer Programming.. 50 Years of Integer Programming, Springer, (2010)TSP Cuts Which Do Not Conform to the Template Paradigm., , , and . Computational Combinatorial Optimization, volume 2241 of Lecture Notes in Computer Science, page 261-304. Springer, (2001)Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem., , and . Math. Oper. Res., 35 (2): 479-493 (2010)On box totally dual integral polyhedra.. Math. Program., 34 (1): 48-61 (1986)Solving Very Sparse Rational Systems of Equations., and . ACM Trans. Math. Softw., 37 (4): 39:1-39:21 (2011)Safe Lower Bounds for Graph Coloring., , and . IPCO, volume 6655 of Lecture Notes in Computer Science, page 261-273. Springer, (2011)Local elimination in the traveling salesman problem., , , and . CoRR, (2023)Federal law and the interstate transfer of stolen computer data: riggs and brown.. Comput. Law Secur. Rev., 8 (2): 77-80 (1992)An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming., , , and . INFORMS J. Comput., 5 (2): 206-212 (1993)A Computational Study of the Job-Shop Scheduling Problem., and . INFORMS J. Comput., 3 (2): 149-156 (1991)