Login / Signup

Bounds for the traveling salesman paths of two-dimensional modular lattices.

Florian Pausinger
Published in: J. Comb. Optim. (2017)
Keyphrases
  • traveling salesman
  • traveling salesman problem
  • three dimensional
  • upper bound
  • lower bound
  • quadratic assignment problem
  • shortest path
  • global optimization
  • lower and upper bounds
  • machine learning
  • worst case