Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

INFORMS
2007

favoriteEmaildiscussreport

83views more INFORMS 2007»

Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP)

13 years 4 months ago

Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP)

Download www2.isye.gatech.edu

William J. Cook, Daniel G. Espinoza, Marcos Goycoo

Real-time Traffic

INFORMS 2007 |

claim paper

Related Content

» Generalized DominoParity Inequalities for the Symmetric Traveling Salesman Problem

» 3544Approximation for Asymmetric Maximum TSP with Triangle Inequality

» TSP Cuts Which Do Not Conform to the Template Paradigm

» Approximation Algorithms for MultiCriteria Traveling Salesman Problems

» Computing the epistasis variance of largescale traveling salesman problems

» Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3Cycle Cover Problem...

» An Ant Colony Optimization Algorithm for Multiple Travelling Salesman Problem

» On Approximating MultiCriteria TSP

» PhraseBased Statistical Machine Translation as a Traveling Salesman Problem

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2007
Where	INFORMS
Authors	William J. Cook, Daniel G. Espinoza, Marcos Goycoolea

Comments (0)