Vasek Chvátal (Selection)

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide -

37 David Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook, Daniel G. Espinoza, Marcos Goycoolea, Keld Helsgaun: Certification of an optimal TSP tour through 85, 900 cities. Oper. Res. Lett. 37(1): 11-15 (2009)

27 David Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook: Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems. Math. Program. 97(1-2): 91-153 (2003)

24 David Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook: TSP Cuts Which Do Not Conform to the Template Paradigm. Computational Combinatorial Optimization 2001: 261-304

23 David Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook: Cutting planes and the traveling salesman problem (abstract only). SODA 2000: 429

Selection of 4 from 42 records - Vasek Chvátal has 30 coauthors

Last update 2012-09-10 CET by the DBLP Team —

Content released under the ODC-BY 1.0 license — See also our legal information page

37		David Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook, Daniel G. Espinoza, Marcos Goycoolea, Keld Helsgaun: Certification of an optimal TSP tour through 85, 900 cities. Oper. Res. Lett. 37(1): 11-15 (2009)
27		David Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook: Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems. Math. Program. 97(1-2): 91-153 (2003)
24		David Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook: TSP Cuts Which Do Not Conform to the Template Paradigm. Computational Combinatorial Optimization 2001: 261-304
23		David Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook: Cutting planes and the traveling salesman problem (abstract only). SODA 2000: 429