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)

Semantic Scholar uses AI to extract papers important to this topic.

2018

2018

- Túlio A. M. Toffolo, Thibaut Vidal, Tony Wauters
- ArXiv
- 2018

We investigate a structural decomposition for the capacitated vehicle routing problem (CVRP) based on vehicle-to-customer… (More)

Is this relevant?

2015

2015

- Darrell Whitley
- 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)

Is this relevant?

2014

2003

2003

- A K Converse, J. A. Nye, +7 authors A. D. Roberts
- 2003 IEEE Nuclear Science Symposium. Conference…
- 2003

Isotopes in routine use for positron emission tomography (PET) produce only a single pair of 511 keV annihilation photons. "Dirty… (More)

Is this relevant?