Solving the Orienteering Problem through Branch-and-Cut-Reference-Cited by-同舟云学术

Solving the Orienteering Problem through Branch-and-Cut

Published:1998-05 Issue:2 Volume:10 Page:133-148
ISSN:1091-9856
Container-title:INFORMS Journal on Computing
language:en
Short-container-title:INFORMS Journal on Computing

Author:

Fischetti Matteo,González Juan José Salazar,Toth Paolo

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

General Engineering

Link

https://pubsonline.informs.org/doi/pdf/10.1287/ijoc.10.2.133

Reference21 articles.

1. The prize collecting traveling salesman problem

2. Balas E. , Martin G. ROLL-A-ROUND: Software Package for Scheduling the Rounds of a Rolling Mill. (1985) (Balas and Martin Associates, 104 Maple Heights Road, Pittsburgh, PA) . Copyright

3. The Circuit Polytope: Facets

4. A fast and effective heuristic for the orienteering problem

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

1. A Bilevel Approach for Compensation and Routing Decisions in Last-Mile Delivery;Transportation Science;2024-08-22

2. An effective hybrid meta-heuristic method for the simultaneous batch production and transportation problem in additive manufacturing;International Journal of Production Research;2024-07-28

3. Multi-Agent Deep Reinforcement Learning for Multi-Modal Orienteering Problem;2024 IEEE 18th International Symposium on Applied Computational Intelligence and Informatics (SACI);2024-05-23

4. A new formulation and a branch-and-cut algorithm for the set orienteering problem;European Journal of Operational Research;2024-04

5. A survey on the Traveling Salesman Problem and its variants in a warehousing context;European Journal of Operational Research;2024-04