Concorde TSP Solver

Summary

Concorde TSP Solver is a software^[1]. It ranks in the top 6% of software entities by monthly Wikipedia readership (18 views/month).^[2]

Key Facts

• Concorde TSP Solver authored David Applegate^[3].
• Concorde TSP Solver authored Robert E. Bixby^[4].
• Concorde TSP Solver authored Václav Chvátal^[5].
• Concorde TSP Solver authored William J. Cook^[6].
• Concorde TSP Solver's instance of is recorded as software^[7].
• Concorde TSP Solver's programmed in is recorded as ANSI C^[8].
• Concorde TSP Solver's Freebase ID is recorded as /m/03yjd7x^[9].
• Concorde TSP Solver's official website is recorded as http://www.math.uwaterloo.ca/tsp/concorde/^[10].
• Concorde TSP Solver's official website is recorded as https://neos-server.org/neos/solvers/co:concorde/TSP.html^[11].
• Concorde TSP Solver's computes solution to is recorded as travelling salesperson problem^[12].

Body

Works and Contributions

Authored works include David Applegate^[3], a mathematician^[13], b. 2000^[14], of United States^[15]; Robert E. Bixby^[4], a mathematician^[16], b. 1945^[17], of United States^[18], awarded the Frederick W. Lanchester Prize^[19], specialised in linear programming^[20]; Václav Chvátal^[5], a mathematician^[21], b. 1946^[22], of Canada^[23], awarded the Frederick W. Lanchester Prize^[24], specialised in combinatorics^[25]; and William J. Cook^[6], a mathematician^[26], b. 1957^[27], of United States^[28], awarded the Frederick W. Lanchester Prize^[29].

Why It Matters

Concorde TSP Solver ranks in the top 6% of software entities by monthly Wikipedia readership (18 views/month).^[2]