Login / Signup

Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems.

Sándor P. FeketeHenk MeijerAndré RoheWalter Tietze
Published in: ALENEX (2001)
Keyphrases
  • traveling salesman problem
  • combinatorial optimization
  • optimization problems
  • ant colony optimization
  • search algorithm
  • multi objective
  • metaheuristic
  • information theoretic
  • exact solution