The Set Orienteering Problem-Reference-Cited by-同舟云学术

The Set Orienteering Problem

Published:2018-05 Issue:1 Volume:267 Page:264-272
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Archetti Claudia^ORCID,Carrabs Francesco^ORCID,Cerulli Raffaele

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference13 articles.

1. The clustered orienteering problem;Angelelli;European Journal of Operational Research,2014

2. Arc routing problems with profits;Archetti,2014

3. Vehicle routing problems with profits;Archetti,2014

4. A branch-and-bound algorithm for the close-enough traveling salesman problem;Coutinho;INFORMS Journal on Computing,2016

5. A branch-and-cut algorithm for the symmetric generalized traveling salesman problem;Fischetti;Operations Research,1997

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

1. A unifying framework for selective routing problems;European Journal of Operational Research;2025-01

2. On solving close enough orienteering problems with overlapped neighborhoods;European Journal of Operational Research;2024-10

3. 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

4. The bi-objective prize collecting traveling backpacker problem for planning flight itineraries;International Journal of Machine Learning and Cybernetics;2024-06-13

5. Seçici Kümelendirilmiş Gezgin Satıcı Problemi ve Matematiksel Formülasyonları;Afyon Kocatepe University Journal of Sciences and Engineering;2024-06-08