Selective generalized travelling salesman problem
From MaRDI portal
Publication:5069320
Recommendations
- The selective travelling salesman problem
- A time-based formulation and upper bounding scheme for the selective travelling salesperson problem
- scientific article; zbMATH DE number 1769325
- A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
- Some Applications of the Generalized Travelling Salesman Problem
Cites work
- scientific article; zbMATH DE number 5621997 (Why is no real title available?)
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
- Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm
- Generalized orienteering problem with resource dependent rewards
- Integer Programming Formulation of Traveling Salesman Problems
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
- New mathematical models of the generalized vehicle routing problem and extensions
- New models of the generalized minimum spanning tree problem
- Orienteering problem: a survey of recent variants, solution approaches and applications
- Solving the stochastic time-dependent orienteering problem with time windows
- Some Applications of the Generalized Travelling Salesman Problem
- The effective application of a new approach to the generalized orienteering problem
- The orienteering problem: a survey
- The set orienteering problem
- Using a genetic algorithm to solve the generalized orienteering problem
- Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants
Cited in
(2)
This page was built for publication: Selective generalized travelling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5069320)