A branch‐and‐cut algorithm for the Team Orienteering Problem

DOI10.1111/itor.12422zbMath1391.90599OpenAlexW2615759333MaRDI QIDQ4642121

Nicola Bianchessi, M. Grazia Speranza, Renata Mansini

Publication date: 22 May 2018

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2434/609523

zbMATH Keywords

branch-and-cut algorithmteam orienteering problemtwo-index mathematical formulation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (17)

A biased-randomized discrete-event heuristic for coordinated multi-vehicle container transport across interconnected networks ⋮ An effective hybrid search algorithm for the multiple traveling repairman problem with profits ⋮ A hybrid adaptive large neighborhood search heuristic for the team orienteering problem ⋮ Trip planning for visitors in a service system with capacity constraints ⋮ An exact method for the combinatorial bids generation problem with uncertainty on clearing prices, bids success, and contracts materialization ⋮ Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand ⋮ Solving the team orienteering problem with nonidentical agents: A Lagrangian approach ⋮ GRASP‐ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows ⋮ A revisited branch-and-cut algorithm for large-scale orienteering problems ⋮ A generic exact solver for vehicle routing and related problems ⋮ Mixed-integer programming approaches for the time-constrained maximal covering routing problem ⋮ Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand ⋮ Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics ⋮ Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem ⋮ The multi-visit team orienteering problem with precedence constraints ⋮ Consistent vehicle routing with pickup decisions -- insights from sport academy training transfers ⋮ Robust drone selective routing in humanitarian transportation network assessment

This page was built for publication: A branch‐and‐cut algorithm for the Team Orienteering Problem