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

DOI10.1007/978-3-642-38171-3_23zbMath1382.90118OpenAlexW2236023658MaRDI QIDQ4922922

Racha El-Hajj, Duc-Cuong Dang, Aziz Moukrim

Publication date: 4 June 2013

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38171-3_23

zbMATH Keywords

branch-and-cutincompatibilitydominance propertyclique cut

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items (13)

Orienteering problem: a survey of recent variants, solution approaches and applications ⋮ Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem ⋮ Solving the team orienteering problem with cutting planes ⋮ A hybrid adaptive large neighborhood search heuristic for the team orienteering problem ⋮ Solving the team orienteering problem with nonidentical agents: A Lagrangian approach ⋮ Variable neighborhood search to solve the generalized orienteering problem ⋮ A revisited branch-and-cut algorithm for large-scale orienteering problems ⋮ A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit ⋮ Mixed-integer programming approaches for the time-constrained maximal covering routing problem ⋮ Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem ⋮ The multi-vehicle probabilistic covering tour problem ⋮ The multi-visit team orienteering problem with precedence constraints ⋮ Consistent vehicle routing with pickup decisions -- insights from sport academy training transfers

This page was built for publication: A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem