A revisited branch-and-cut algorithm for large-scale orienteering problems

DOI10.1016/j.ejor.2023.07.034arXiv2011.02743OpenAlexW3097633812MaRDI QIDQ6087525

Jairo Rojas-Delgado, Gorka Kobeaga, María Merino, José A. Lozano

Publication date: 15 November 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.02743

zbMATH Keywords

branch-and-cutroutingorienteering problemlarge problems

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Orienteering problem: a survey of recent variants, solution approaches and applications
• A branch-and-cut algorithm for the orienteering arc routing problem
• The orienteering problem: a survey
• Solution of large-scale symmetric travelling salesman problems
• The selective travelling salesman problem
• Strong linear programming relaxations for the orienteering problem
• The probabilistic orienteering problem
• An efficient evolutionary algorithm for the orienteering problem
• Solving the team orienteering arc routing problem with a column generation approach
• Boosting ant colony optimization via solution prediction and machine learning
• On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms
• Complexity and approximation for traveling salesman problems with profits
• An exact algorithm for team orienteering problems
• Cut Tree Algorithms: An Experimental Study
• The Team Orienteering Problem: Formulations and Branch-Cut and Price
• The orienteering problem
• The prize collecting traveling salesman problem
• On the symmetric travelling salesman problem: A computational study
• An Optimal Algorithm for the Orienteering Tour Problem
• Facets of the knapsack polytope
• The Circuit Polytope: Facets
• Solving the Orienteering Problem through Branch-and-Cut
• A branch‐and‐cut algorithm for the Team Orienteering Problem
• A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem
• On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem

This page was built for publication: A revisited branch-and-cut algorithm for large-scale orienteering problems