Login / Signup
Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem.
Michel X. Goemans
Dimitris J. Bertsimas
Published in:
Math. Oper. Res. (1991)
Keyphrases
</>
traveling salesman problem
lower bound
ant colony optimization
bayesian networks
probabilistic model
combinatorial optimization
np hard
upper bound
markov random field
constraint satisfaction
combinatorial problems
ant colony optimization algorithm
discrete particle swarm optimization