Login / Signup
Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems
Sándor P. Fekete
Henk Meijer
André Rohe
Walter Tietze
Published in:
CoRR (2002)
Keyphrases
</>
traveling salesman problem
combinatorial optimization
combinatorial optimization problems
neural network
search algorithm
optimization problems
similarity search
exact solution
distribution network