Discrete Applied Mathematics

Editorial(s)
pp. 1-2(2)
Authors: Gutin G.; Punnen A.

Tabu search and finite convergence
pp. 3-36(34)
Authors: Glover F.; Hanafi S.

On the convergence of generalized hill climbing algorithms
pp. 37-57(21)
Authors: Johnson A.W.; Jacobson S.H.

Generation of lower bounds for minimum span frequency assignment
pp. 59-78(20)
Authors: Allen S.M.; Smith D.H.; Hurley S.

Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
pp. 79-106(28)
Authors: Anjos¹ M.F.; Wolkowicz² H.

Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
pp. 107-116(10)
Authors: Gutin G.; Yeo A.

Domination analysis of some heuristics for the traveling salesman problem
pp. 117-128(12)
Authors: Punnen¹ A.; Kabadi² S.

Approximation algorithms for multi-parameter graph optimization problems
pp. 129-138(10)
Authors: Basov I.; Vainshtein A.

An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices
pp. 139-148(10)
Authors: Blokh D.; Levner E.

New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization
pp. 149-167(19)
Author: Kabadi S.N.

On-line scheduling with precedence constraints
pp. 169-180(12)
Authors: Azar¹ Y.; Epstein L.

A tabu search algorithm for scheduling a single robot in a job-shop environment
pp. 181-203(23)
Authors: Hurink J.; Knust¹ S.