Concorde TSP Solver

Known as: Concorde (disambiguation) 
The Concorde TSP Solver is a program for solving the traveling salesman problem. It was written by David Applegate, Robert E. Bixby, Vašek Chvátal… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2003-2018
01220032018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We investigate a structural decomposition for the capacitated vehicle routing problem (CVRP) based on vehicle-to-customer… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2015
2015
There are a number of NP-hard optimization problems where the search space can be characterized as an elementary landscape. For… (More)
Is this relevant?
2014
2014
The Traveling Salesman Problem is one of the best studied NP-hard problems in combinatorial optimization. Powerful methods have… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
Is this relevant?
2014
2003
2003
Isotopes in routine use for positron emission tomography (PET) produce only a single pair of 511 keV annihilation photons. "Dirty… (More)
  • figure 1
  • figure 2
  • figure 5
  • figure 4
  • figure 3
Is this relevant?