The Team Orienteering Problem: Formulations and Branch-Cut and Price

Authors Marcus Poggi, Henrique Viana, Eduardo Uchoa

Thumbnail PDF


  • Filesize: 488 kB
  • 14 pages

Document Identifiers

Author Details

Marcus Poggi
Henrique Viana
Eduardo Uchoa

Cite AsGet BibTex

Marcus Poggi, Henrique Viana, and Eduardo Uchoa. The Team Orienteering Problem: Formulations and Branch-Cut and Price. In 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10). Open Access Series in Informatics (OASIcs), Volume 14, pp. 142-155, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)


The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical vehicles, with a limited total duration for their routes, is given. The total profit gathered by all routes is to be maximized. We devise an extended formulation where edges are indexed by the time they are placed in the route. A new class of inequalities, min cut, and the triangle clique cuts of Pessoa et. al., 2007 are added. The resulting formulation is solved by column generation. Branching is done following the work of Boussier et al. 2007, to which the branch-cut-and-price algorithm here proposed is compared. A few new upper bounds were obtained. Overall the presented approach has shown to be very competitive.
  • Branch-Cut and Price
  • Team Orienteering Problem
  • Column Generation


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail