Solving the team orienteering problem with nonidentical agents: A Lagrangian approach

DOI10.1002/net.22023OpenAlexW3125771032MaRDI QIDQ6065837

Y. K. Agarwal, Unnamed Author

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22023

zbMATH Keywords

integer programmingLagrangian relaxationduality gapteam orienteeringsymmetry breaking constraintsnonidentical agents

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10)

Cites Work

• Unnamed Item
• Orienteering problem: a survey of recent variants, solution approaches and applications
• Solving the team orienteering problem with cutting planes
• The orienteering problem: a survey
• A path relinking approach for the team orienteering problem
• The team orienteering problem
• A heuristic for the multiple tour maximum collection problem
• A TABU search heuristic for the team orienteering problem
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search
• The multi-visit team orienteering problem with precedence constraints
• An effective PSO-inspired algorithm for the team orienteering problem
• A guided local search metaheuristic for the team orienteering problem
• An exact algorithm for team orienteering problems
• The Team Orienteering Problem: Formulations and Branch-Cut and Price
• The capacitated team orienteering and profitable tour problems
• The orienteering problem
• Solving the Orienteering Problem through Branch-and-Cut
• A branch‐and‐cut algorithm for the Team Orienteering Problem
• A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem

This page was built for publication: Solving the team orienteering problem with nonidentical agents: A Lagrangian approach