The Team Orienteering Problem: Formulations and Branch-Cut and Price
From MaRDI portal
Publication:2917295
DOI10.4230/OASIcs.ATMOS.2010.142zbMath1247.90060OpenAlexW1551431374MaRDI QIDQ2917295
Eduardo Uchoa, Marcus Poggi, Henrique Viana
Publication date: 28 September 2012
Full work available at URL: https://doi.org/10.4230/OASIcs.ATMOS.2010.142
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Related Items
Orienteering problem: a survey of recent variants, solution approaches and applications ⋮ Solving the team orienteering problem with cutting planes ⋮ Algorithm selection for the team orienteering problem ⋮ An effective hybrid search algorithm for the multiple traveling repairman problem with profits ⋮ The capacitated team orienteering problem with incomplete service ⋮ A hybrid adaptive large neighborhood search heuristic for the team orienteering problem ⋮ Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach ⋮ Solving the team orienteering problem with nonidentical agents: A Lagrangian approach ⋮ 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 ⋮ Robust UAV mission planning ⋮ Mixed-integer programming approaches for the time-constrained maximal covering routing problem ⋮ Solving the team orienteering arc routing problem with a column generation approach ⋮ Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem ⋮ An effective PSO-inspired algorithm for the team orienteering problem
