scientific article; zbMATH DE number 2064415
From MaRDI portal
Publication:4461914
zbMath1113.90350MaRDI QIDQ4461914
E. Kh. Gimadi, A. I. Serdyukov, Alexander I. Barvinok
Publication date: 18 May 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (11)
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems ⋮ Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension ⋮ A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem ⋮ An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem ⋮ Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding ⋮ Asymptotically optimal algorithms for geometric MAX TSP and MAX \(m\)-PSP ⋮ Limitations of incremental dynamic programming ⋮ On the core of multiple longest traveling salesman games ⋮ Asymptotically optimal algorithm for finding one and two edge-disjoint traveling salesman routes of maximal weight in Euclidean space ⋮ Factoring a band matrix over a semiring ⋮ A \(\frac78\)-approximation algorithm for metric Max TSP
This page was built for publication:
