The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)

By David L. Applegate, Robert E. Bixby, V. Chvátal, W. Cook. 2007

577 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Management Science and Operations Research

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Giovanni Neglia
2. Othmane Marfoq
3. Richard Vidal
4. Chuan Xu
5. Iain Dunning
6. Joey Huchette
7. Miles Lubin

In Management Science and Operations Research

1. Giovanni Neglia
2. Chuan Xu
3. Iain Dunning
4. Joey Huchette
5. Miles Lubin

Citations in the corpus

• Throughput-Optimal Topology Design for Cross-Silo Federated Learning (2020, methodology): “Finding the optimal tour in a complete graph is a well known problem and is referred to as the Traveling Salesman Problem (TSP), see for example [4].”
• JuMP: A Modeling Language for Mathematical Optimization (2015, methodology): “For example, branch-and-cut is a powerful technique in integer programming for accelerating the solution process by dynamically improving the convex (linear) relaxations used within the branch-and-bound algorithm; this technique was essential to the significant progress in the past decade in exact s”