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

DOI10.1007/3-540-44808-X_1zbMath1010.68838OpenAlexW2178480572MaRDI QIDQ4801176

Sándor P. Fekete, Walter Tietze, André Rohe, Henk G. Meijer

Publication date: 7 April 2003

Published in: Algorithm Engineering and Experimentation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-44808-x_1

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem ⋮ Winding indexes of Max. and Min. Hamiltonians in N-Gons

This page was built for publication: Solving a “Hard” Problem to Approximate an “Easy” One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems