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:
ACM J. Exp. Algorithmics (2002)
Keyphrases
</>
traveling salesman problem
combinatorial optimization
neural network
genetic algorithm
search algorithm
multi objective
timetabling problem