Discrete Applied Mathematics · 2002 · 57 citations · 10 references
ComputingComputer ScienceMathematicsAlgorithmsDiscrete MathematicsTheory Of ComputationApproximation AlgorithmsApproximation MethodsCombinatorial OptimizationComputational ComplexityShortest Path AlgorithmsHigh-order Polynomial ApproximationPolynomial-time AlgorithmsPolynomial-time Approximation SchemeTraveling Salesman ApproximationTraveling Salesperson Problem Approximation
10
Construction heuristics for the asymmetric TSP
Fred Glover, Gregory Gutin, Anders Yeo et al. · European Journal of Operational Research · 2001 · 108 citations
A Hamiltonian decomposition of K2m∗, 2m ≥ 8
Timothy W Tillson · Journal of Combinatorial Theory Series B · 1980 · 106 citations