The Traveling Salesman

@inproceedings{Reinelt1994TheTS,
  title={The Traveling Salesman},
  author={Gerhard Reinelt},
  booktitle={Lecture Notes in Computer Science},
  year={1994}
}
Optimization The traveling salesman is an optimization algorithm The goal is to find a combination of parameters that give the highest or lowest value for a function 2 graph for a function z = f(x,y) what values of x and y give the highest value of f? 
BETA

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 75 CITATIONS

Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough?

  • ACM Journal of Experimental Algorithmics
  • 2009
VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Solving Small TSPs with Constraints

VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Solving large travelling salesman problems with small populations

VIEW 5 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1993
2018

CITATION STATISTICS

  • 10 Highly Influenced Citations

  • Averaged 2 Citations per year over the last 3 years

References

Publications referenced by this paper.
SHOWING 1-10 OF 86 REFERENCES

Geometric Duality and Combinatorial Optimization

W.R.M. Jünger
  • Pulleyblank
  • 1993
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

A Survey of Bundle Methods for Nondifferentiable Optimization

K. C. Kiwiel
  • Mathematical Programming. Recent Developments and Applications,
  • 1989
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Theory of Linear and Integer Programming

David K. Smith
  • 1987
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Data Structures and Network Algorithms

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

The Traveling-Salesman Problem and Minimum Spanning Trees

  • Operations Research
  • 1970
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Decomposition in Traveling Salesman Problems

T. C. Hu
  • Proc. IFORS Theory of Graphs,
  • 1965
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Similar Papers

Loading similar papers…