Reduction rules for the covering tour problem

MaRDI QIDQ2741492zbMATH OpenFDO

Authors Luciene C. S. Motta, Luiz S. Ochi, Carlos Martinhon

Publication date 24 October 2001

zbMATH Keywords

covering tour problemHamiltonian cyclelinear programtraveling salesman problemundirected graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Deterministic scheduling theory in operations research (90B35) Linear programming (90C05)

Recommendations

• The Covering Tour Problem
• Iterative column generation algorithm for generalized multi-vehicle covering tour problem
• A GRAST/VNS metaheuristic for an approximate solution of the covering tour problem
• An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
• An integer programming-based local search for the covering salesman problem

Cites work

• scientific article; zbMATH DE number 2209648 (Why is no real title available?)
• The Covering Salesman Problem
• The Covering Tour Problem
• Variable neighborhood search

Cited in

(3)

• The Covering Tour Problem
• Iterative column generation algorithm for generalized multi-vehicle covering tour problem
• A GRAST/VNS metaheuristic for an approximate solution of the covering tour problem

This page was built for publication: Reduction rules for the covering tour problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2741492)