The set team orienteering problem
From MaRDI portal
Cites work
- A biased random-key genetic algorithm for the set orienteering problem
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
- A new formulation and a branch-and-cut algorithm for the set orienteering problem
- An adaptive memory matheuristic for the set orienteering problem
- An efficient transformation of the generalized vehicle routing problem
- An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size
- Efficient elementary and restricted non-elementary route pricing
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- Generalized traveling salesman problem reduction algorithms
- New route relaxation and pricing strategies for the vehicle routing problem
- Orienteering problem: a survey of recent variants, solution approaches and applications
- The clustered orienteering problem
- The clustered team orienteering problem
- The set orienteering problem
- Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants
This page was built for publication: The set team orienteering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982443)