Reduction Rules for the Covering Tour Problem

The Covering Tour Problem (CTP) is a generalization of the Traveling Salesman Problem (TSP) which has several actual applications. It is denned on an undirected graph G = ( V ∪ W, E), where W is a set of vertices that must be covered. The problem consists of determining a minimum length Hamiltonian...

Full description

Saved in:
Bibliographic Details
Published inElectronic notes in discrete mathematics Vol. 7; pp. 142 - 145
Main Authors Motta, Luciene C.S., Ochi, Luiz Satoru, Martinhon, Carlos A.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.04.2001
Subjects
Covering Tour Problem
mathematical formulation
reduction rules
mathematical formulation
Covering Tour Problem
reduction rules
Online AccessGet full text

Cover

More Information
Summary:The Covering Tour Problem (CTP) is a generalization of the Traveling Salesman Problem (TSP) which has several actual applications. It is denned on an undirected graph G = ( V ∪ W, E), where W is a set of vertices that must be covered. The problem consists of determining a minimum length Hamiltonian cycle on a subset of V such that every vertex of W is within a given distance d from, at least, one node in the cycle. This work proposes reduction rules to a generalization of the CTP and also a new Integer Linear Program formulation.
ISSN:1571-0653
1571-0653
DOI:10.1016/S1571-0653(04)00245-8