Efficiently solvable special cases of bottleneck travelling salesman problems
Discrete Applied Mathematics
A New Class of Pyramidally Solvable Symmetric Traveling Salesman Problems
SIAM Journal on Discrete Mathematics
Perspectives of Monge properties in optimization
Discrete Applied Mathematics
On the euclidean TSP with a permuted Van der Veen matrix
Information Processing Letters
A new asymmetric pyramidally solvable class of the traveling salesman problem
Operations Research Letters
| Hi-index | 0.00 |
In this study, we work on the traveling salesperson problems and bottleneck traveling salesperson problems that have special matrix structures and lead to polynomially solvable cases. We extend the problems to multiple objectives and investigate the properties of the nondominated points. We develop a pseudo-polynomial time algorithm to find a nondominated point for any number of objectives. Finally, we propose an approach to generate all nondominated points for the biobjective case.