A branch-and-cut algorithm for the team orienteering problem

DOI10.1111/ITOR.12422MaRDI QIDQ4642121zbMATH OpenOpenAlexFDO

Authors Nicola Bianchessi, Renata Mansini, M. Grazia Speranza

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)

Recommendations

• A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem
• The team orienteering problem: formulations and branch-cut and price
• Solving the team orienteering problem with cutting planes
• An exact algorithm for team orienteering problems
• Solving the Orienteering Problem through Branch-and-Cut

Cited in

(31)

• The team orienteering problem: formulations and branch-cut and price
• Solving the Orienteering Problem through Branch-and-Cut
• A generic exact solver for vehicle routing and related problems
• Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics
• Mixed-integer programming approaches for the time-constrained maximal covering routing problem
• The team orienteering problem
• A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem
• Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem
• Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand
• Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand
• A matheuristic for the team orienteering arc routing problem
• A branch-and-cut algorithm for the orienteering arc routing problem
• The multi-visit team orienteering problem with precedence constraints
• 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
• An effective hybrid search algorithm for the multiple traveling repairman problem with profits
• Trip planning for visitors in a service system with capacity constraints
• Algorithm selection for the team orienteering problem
• Solving the team orienteering problem with cutting planes
• A revisited branch-and-cut algorithm for large-scale orienteering problems
• Optimal solutions for routing problems with profits
• An exact method for the combinatorial bids generation problem with uncertainty on clearing prices, bids success, and contracts materialization
• A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
• The snow team problem (clearing directed subgraphs by mobile agents)
• Formulations for the orienteering problem with additional constraints
• An iterative three-component heuristic for the team orienteering problem with time windows
• A flow-based model for the multivehicle covering tour problem with route balancing
• A biased-randomized discrete-event heuristic for coordinated multi-vehicle container transport across interconnected networks
• Consistent vehicle routing with pickup decisions -- insights from sport academy training transfers
• Robust drone selective routing in humanitarian transportation network assessment
• An exact algorithm for team orienteering problems

This page was built for publication: A branch-and-cut algorithm for the team orienteering problem

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