Category: <span>Papers</span>

Comments on: Perspectives on integer programming for time-dependent models

This paper presents an updated and comprehensive review of discrete optimization techniques for solving time-dependent problems, ie decision problems in which activities and resources have to be scheduled over time. Known compact models with continuous variables representing arrival/service/departure times are …

Time-dependent asymmetric traveling salesman problem with time windows: Properties and an exact algorithm

In this paper, we deal with the Time-Dependent Asymmetric Traveling Salesman Problem with Time Windows. First, we prove that under special conditions the problem can be solved as an Asymmetric Traveling Salesman Problem with Time Windows, with suitable-defined time windows …

A branch-and-bound algorithm for the time-Dependent rural postman problem

This paper deals with the time-dependent version of the classical Rural Postman Problem in which arc traversal times vary along the planning horizon. The relationship with the time-invariant counterpart is investigated and a branch-and-bound algorithm is developed. Extensive computational results …

Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization

The precedence constrained traveling salesman problem (TSP-PC), or the sequential ordering problem (SOP), consists of finding an optimal TSP tour that will also satisfy the namesake precedence constraints, typically specified as a partial order or a directed acyclic graph. Its …

x
This site uses cookies to make navigation simple and efficient. By continuing you declare that you want to automatically accept the privacy policy. More. Close