In this paper we revise and modify an old branch-and-bound method for solving the
asymmetric distance–constrained vehicle routing problem suggested by Laporte et al. in …

By performing stability analysis on an optimal tour for problems belonging to classes of the
traveling salesman problem (TSP), this paper derives margins of optimality for a solution …

In this paper, we develop a new tolerance-based Branch and Bound algorithm for solving
NP-hard problems. In particular, we consider the asymmetric traveling salesman problem …

We introduce a new combinatorial optimization problem, which is a generalization of the
Traveling Salesman Problem (TSP) and which we call Traveling Salesman Problem of …

This paper considers combinatorial optimization problems with an objective of type
bottleneck, so the objective is to minimize the maximum cost among all elements in a …

We determine the sensitivity of a current optimal solution to a combinatorial optimization
problem to cost changes in a set of elements. In a recent study, the concept of regular set …

Optimization heuristics are often compared with each other to determine which one performs
best by means of worst-case performance ratio reflecting the quality of returned solution in …

Helsgaun has introduced and implemented the lower tolerances (α-values) for an
approximation of Held-Karp's 1-tree with the purpose to improve the Lin-Kernighan Heuristic …

We introduce a reduction technique for large instances of the traveling salesman problem
(TSP). This approach is based on the observation that tours with good quality are likely to …

We introduce a reduction technique for the well-known TSP. The basic idea of the approach
consists of transforming a TSP instance to another one with smaller size by contracting …