New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization

Authors:
Santosh N. Kabadi
Affiliations:
-
Venue:
Discrete Applied Mathematics
Year:
2002

Citing 0
Cited 3

Traveling salesman games with the Monge property

Discrete Applied Mathematics
A new asymmetric pyramidally solvable class of the traveling salesman problem

Operations Research Letters
On Eulerian extensions and their application to no-wait flowshop scheduling

Journal of Scheduling

Quantified Score

Hi-index	0.08

Visualization

Abstract