Free Access
RAIRO-Oper. Res.
Volume 55, 2021
Regular articles published in advance of the transition of the journal to Subscribe to Open (S2O). Free supplement sponsored by the Fonds National pour la Science Ouverte
Page(s) S719 - S726
Published online 02 March 2021
  • T. Achterberg and T. Berthold, Hybrid branching. In: International Conference on AI and OR Techniques in Constriant Programming for Combinatorial Optimization Problems. Springer (2009) 309–311. [Google Scholar]
  • B. Awerbuch, Y. Azar, A. Blum and S. Vempala, New approximation guarantees for minimum-weight k-trees and prize-collecting salesmen. SIAM J. Comput. 28 (1998) 254–262. [Google Scholar]
  • E. Balas, The prize collecting traveling salesman problem. Networks 19 (1989) 621–636. [Google Scholar]
  • E. Balas, The Prize Collecting Traveling Salesman Problem and its Applications. Springer, Boston, MA (2007). [Google Scholar]
  • T. Berthold, Primal heuristics for mixed integer programs (2006). [Google Scholar]
  • T. Berthold, Heuristics of the branch-cut-and-price-framework scip. In: Operations Research Proceedings 2007. Springer (2008) 31–36. [Google Scholar]
  • D. Bienstock, M.X. Goemans, D. Simchi-Levi and D. Williamson, A note on the prize collecting traveling salesman problem. Math. Program. 59 (1993) 413–420. [Google Scholar]
  • A.A. Chaves and L.A.N. Lorena, Hybrid algorithms with detection of promising areas for the prize collecting travelling salesman problem. In: Fifth International Conference on Hybrid Intelligent Systems (HIS’05). IEEE (2005) 49–54. [Google Scholar]
  • L. Ciupala and E. Ciurea, About preflow algorithms for the minimum flow problem. WSEAS Trans. Comput. Res. 3 (2008) 35–42. [Google Scholar]
  • G. Clímaco, I. Rosseti, L. Simonetti and M. Guerine, Combining integer linear programming with a state-of-the-art heuristic for the 2-path network design problem. Int. Trans. Oper. Res. 26 (2018) 615–641. [Google Scholar]
  • M. Dell’Amico, F. Maffioli, and A. Sciomachen, A lagrangian heuristic for the prize collectingtravelling salesman problem. Ann. Oper. Res. 81 (1998) 289–306. [Google Scholar]
  • M. Fischetti and P. Toth, An additive approach for the optimal solution of the prize collecting traveling salesman problem. Veh. Routing: Methods Stud. 231 (1988) 319–343. [Google Scholar]
  • M. Gendreau, A. Hertz and G. Laporte, New insertion and postoptimization procedures for the traveling salesman problem. Oper. Res. 40 (1992) 1086–1094. [Google Scholar]
  • M.T. Goodrich and R. Tamassia, The christofides approximation algorithm. In: Algorithm Design and Applications. Wiley (2015) 513–514. [Google Scholar]
  • O. Kramer, Genetic Algorithm Essentials. In Vol. 670 of Studies in Computational Intelligence. Springer (2017). [Google Scholar]
  • M. Laguna, Tabu search. In: Handbook of Heuristics (2018) 741–758. [Google Scholar]
  • N. Mladenović, D. Urosevic, S. Hanafi and A. Ilic, A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem. Eur. J. Oper. Res. 220 (2012) 270–285. [Google Scholar]
  • PassMark, CPU Benchmarks. Available from: (2019). [Google Scholar]
  • O. Pedro, R. Saldanha and R. Camargo, A Tabu Search Approach for the Prize Collecting Traveling Salesman Problem. Electron. Notes Discrete Math. 41 (2013) 261–268. [Google Scholar]
  • B.Q. Pinto, C.C. Ribeiro, I. Rosseti and A. Plastino, A biased random-key genetic algorithm for the maximum quasi-clique problem. Eur. J. Oper. Res. 271 (2018) 849–865. [Google Scholar]
  • M.G.C. Resende and C.C. Ribeiro, Optimization by GRASP. Springer (2016). [Google Scholar]
  • C.F.M. Toledo, M. da Silva Arantes, M.Y.B. Hossomi, P.M. França and K. Akartunalı, A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems. J. Heuristics 21 (2015) 687–717. [CrossRef] [Google Scholar]
  • R.D. Torres and J.A.M. Brito, Problemas de coleta de prêmios seletiva. In: Simpósio Brasileiro de Pesquisa Operacional (SBPO) 35 (2003) 1359–1371. [Google Scholar]
  • L.A. Wolsey and G.L. Nemhauser, Integer and Combinatorial Optimization. John Wiley & Sons (2014). [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.