Algorithmic design, especially for hard problems, is more essential for success in solving
them than any standard improvement of current computer tech nologies. Because of this, the …

The time-dependent orienteering problem is dual to the time-dependent traveling salesman
problem. It consists of visiting a maximum number of sites within a given deadline. The …

This chapter retraces the joint history of operations research and the traveling salesman
problem. After presenting the problem, it proposes first exact then approximation algorithms …

We consider the following reoptimization scenario: Given an instance of an optimization
problem together with an optimal solution, we want to find a high-quality solution for a locally …

Given an instance of TSP together with an optimal solution, we consider the scenario in
which this instance is modified locally, where a local modification consists in the alteration of …

We first prove that the minimum and maximum traveling salesman problems, their metric
versions as well as some versions defined on parameterized triangle inequalities (called …

The point of adversarial analysis is to model the worst-case performance of an algorithm.
Unfortunately, this analysis may not always reect performance in practice because the …

Given an instance of an optimization problem together with an optimal solution, we consider
the scenario in which this instance is modified locally. In graph problems, eg, a singular …

Facility Dispersion Problem, originally studied in Operations Research, has recently found
important new applications in Result Diversification approach in information sciences. This …

We consider the asymmetric traveling salesperson problem with γ-parameterized triangle
inequality for γ∈[1/2, 1). That means, the edge weights fulfill w (u, v)⩽ γ⋅(w (u, x)+ w (x, v)) …