Selective generalized travelling salesman problem
From MaRDI portal
Publication:5069320
DOI10.1080/13873954.2019.1705496zbMath1490.90241OpenAlexW2997023520WikidataQ126394914 ScholiaQ126394914MaRDI QIDQ5069320
Esra Dinler, Bariş Keçeci, Tusan Derya
Publication date: 8 April 2022
Published in: Mathematical and Computer Modelling of Dynamical Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/13873954.2019.1705496
Uses Software
Cites Work
- Unnamed Item
- Orienteering problem: a survey of recent variants, solution approaches and applications
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem
- The orienteering problem: a survey
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
- New models of the generalized minimum spanning tree problem
- The effective application of a new approach to the generalized orienteering problem
- Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
- Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants
- Solving the stochastic time-dependent orienteering problem with time windows
- The set orienteering problem
- New mathematical models of the generalized vehicle routing problem and extensions
- Integer Programming Formulation of Traveling Salesman Problems
- Using a Genetic Algorithm to Solve the Generalized Orienteering Problem
- Some Applications of the Generalized Travelling Salesman Problem
- Generalized orienteering problem with resource dependent rewards
This page was built for publication: Selective generalized travelling salesman problem