Login / Signup

Determination of the candidate arc set for the asymmetric traveling salesman problem.

Sang-Ho KwonHun-Tae KimMaing-Kyu Kang
Published in: Comput. Oper. Res. (2005)
Keyphrases
  • small number
  • data sets
  • information retrieval
  • website
  • similarity measure
  • bayesian networks
  • multi agent
  • probability distribution
  • upper bound
  • branch and bound
  • branch and bound algorithm