Publications of A. Mingozzi

This page shows all publications that appeared in the IASI annual research reports. Authors currently affiliated with the Institute are always listed with the full name.

You can browse through them using either the links of the following line or those associated with author names.

Show all publications of the year  ALL, with author Mingozzi A., in the category IASI Research Reports (or show them all):


IASI Research Report n. 310  (Previous    Next)


Bianco L., Mingozzi A., Ricciardelli S., Spadoni M.

Traveling salesman problem with precedence constraints.

ABSTRACT
The Traveling Salesman Problem with Precedence Constraints is to find an hamiltonian tour of minimum cost in a graph G = (X, A) of n vertices, starting from vertex 1, visiting every vertex that must precede i before i (i = 2,3,...,n) and returning to vertex 1. This problem is NP-hard and arises in practical transportation and sequencing problems.In this paper we describe a new bounding procedure and a new optimal algorithm, based on dynamic programming. Computational results are given for randomly generated test problems, including the dial-a-ride problem with the classical TSP objective function.
back
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -