A branch‐and‐cut algorithm for the Team Orienteering Problem-Reference-Cited by-同舟云学术

A branch‐and‐cut algorithm for the Team Orienteering Problem

Published:2017-05-17 Issue:2 Volume:25 Page:627-635
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:Intl. Trans. in Op. Res.

Author:

Bianchessi Nicola¹,Mansini Renata²,Speranza M. Grazia³

Affiliation:

1. Chair of Logistics ManagementGutenberg School of Management and Economics, Johannes Gutenberg University MainzJakob‐Welder‐Weg 9 D‐55128 Mainz Germany

2. Department of Information EngineeringUniversity of Bresciavia Branze 38 25123 Brescia Italy

3. Department of Economics and ManagementUniversity of BresciaC.da S. Chiara 50 25122 Brescia Italy

Publisher

Wiley

Subject

Management of Technology and Innovation,Management Science and Operations Research,Strategy and Management,Computer Science Applications,Business and International Management

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1111/itor.12422

Reference11 articles.

1. An exact algorithm for team orienteering problems;Boussier S.;4OR,2007

2. An experimental comparison of min‐cut/max‐flow algorithms for energy minimization in vision;Boykov Y.;IEEE Transactions on Pattern Analysis and Machine Intelligence,2004

3. An optimal solution procedure for the multiple tour maximum collection problem using column generation;Butt S.E.;Computers & Operations Research,1999

4. The team orienteering problem;Chao I.‐M.;European Journal of Operational Research,1996

5. A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem

Cited by 52 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Branch-Price-and-Cut algorithms for the team orienteering problem with interval-varying profits;European Journal of Operational Research;2024-12

2. An effective multi-level memetic search with neighborhood reduction for the clustered team orienteering problem;European Journal of Operational Research;2024-11

3. An efficient hybrid adaptive large neighborhood search method for the capacitated team orienteering problem;Expert Systems with Applications;2024-09

4. Um algoritmo branch-and-price para o problema de orientação de times com conjuntos;Anais do IX Encontro de Teoria da Computação (ETC 2024);2024-07-21

5. A revisited branch-and-cut algorithm for large-scale orienteering problems;European Journal of Operational Research;2024-02