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

DOI10.1007/978-3-642-38171-3_23MaRDI QIDQ4922922zbMATH OpenOpenAlexFDO

Authors Duc-Cuong Dang, Racha El-Hajj, A. 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-cutclique cutdominance propertyincompatibility

Mathematics Subject Classification ID

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

Recommendations

• A branch-and-cut algorithm for the team orienteering problem
• The team orienteering problem: formulations and branch-cut and price
• An exact algorithm for team orienteering problems
• A branch-and-cut algorithm for the orienteering arc routing problem
• Algorithm selection for the team orienteering problem
• A TABU search heuristic for the team orienteering problem
• A path relinking approach for the team orienteering problem
• Solving the Orienteering Problem through Branch-and-Cut
• Solving the team orienteering problem with cutting planes
• A matheuristic for the team orienteering arc routing problem

Cited in

(29)

• The team orienteering problem
• The snow team problem (clearing directed subgraphs by mobile agents)
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search
• Optimal solutions for routing problems with profits
• Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem
• Consistent vehicle routing with pickup decisions -- insights from sport academy training transfers
• Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem
• Algorithm selection for the team orienteering problem
• 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
• The clustered team orienteering problem
• The multi-visit team orienteering problem with precedence constraints
• An effective PSO-inspired algorithm for the team orienteering problem
• An exact algorithm for team orienteering problems
• A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
• The team orienteering problem: formulations and branch-cut and price
• A matheuristic for the team orienteering arc routing problem
• Orienteering problem: a survey of recent variants, solution approaches and applications
• A branch-and-cut algorithm for the orienteering arc routing problem
• Solving the team orienteering problem with cutting planes
• Solving the Orienteering Problem through Branch-and-Cut
• A branch-and-cut algorithm for the team orienteering problem
• An iterated local search algorithm for the team orienteering problem with variable profits
• 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 large neighborhood search-based approach to tackle the very large scale team orienteering problem in industrial context
• The multi-vehicle probabilistic covering tour problem
• A memetic algorithm for the team orienteering problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922922)