Recommendations
- scientific article; zbMATH DE number 1769325
- A time-based formulation and upper bounding scheme for the selective travelling salesperson problem
- Algorithms for a stochastic selective travelling salesperson problem
- scientific article; zbMATH DE number 795217
- An improved branching rule for the symmetric travelling salesman problem
Cites work
- scientific article; zbMATH DE number 3989108 (Why is no real title available?)
- scientific article; zbMATH DE number 4061010 (Why is no real title available?)
- scientific article; zbMATH DE number 41051 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm
- Generalized Subtour Elimination Constraints and Connectivity Constraints
- The orienteering problem
Cited in
(only showing first 100 items - show all)- An integer programming-based local search for the covering salesman problem
- Shuffling heuristics for the storage location assignment in an AS/RS
- A cooperative team orienteering optimisation model and a customised resolution metaheuristic
- A fast solution method for the time-dependent orienteering problem
- A guided local search metaheuristic for the team orienteering problem
- Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach
- An iterated local search algorithm for the team orienteering problem with variable profits
- Finding the nucleolus of the vehicle routing game with time windows
- A comprehensive survey on the generalized traveling salesman problem
- A two-stage vehicle routing model for large-scale bioterrorism emergencies
- PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems
- The orienteering problem: a survey
- Orienteering problem with time-windows and updating delay
- Arrival and service time dependencies in the single- and multi-visit selective traveling salesman problem
- A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
- Genetic algorithm for combinatorial path planning: the subtour problem
- The generalized covering salesman problem
- The hazardous orienteering problem
- A matheuristic approach to the orienteering problem with service time dependent profits
- Shared capacity routing problem -- an omni-channel retail study
- Online covering salesman problem
- An exact -constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
- An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem
- On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
- Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics
- Pre-selection strategies for dynamic collaborative transportation planning problems
- Multi-objective meta-heuristics for the traveling salesman problem with profits
- Mixed-integer programming approaches for the time-constrained maximal covering routing problem
- PathWyse: a flexible, open-source library for the resource constrained shortest path problem
- Attractive orienteering problem with proximity and timing interactions
- A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints
- Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem
- A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem
- The clustered orienteering problem
- scientific article; zbMATH DE number 1769325 (Why is no real title available?)
- A two-stage approach to the orienteering problem with stochastic weights
- Solving relaxation orienteering problem using DCA-CUT
- AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES
- Minimum directed 1-subtree relaxation for score orienteering problem
- The orienteering problem with variable profits
- Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem
- Local search for the undirected capacitated arc routing problem with profits
- A tabu search algorithm for the probabilistic orienteering problem
- Density peak clustering using grey wolf optimization approach
- Multi-start heuristics for unit-capacity orienteering problems
- A multi-period analysis of the integrated item-sharing and crowdshipping problem
- Iterated local search for the team orienteering problem with time windows
- Exact algorithms for budgeted prize-collecting covering subgraph problems
- UAV routing for reconnaissance mission: a multi-objective orienteering problem with time-dependent prizes and multiple connections
- The multiobjective traveling salesman-repairman problem with profits: design and implementation of a variable neighborhood descent algorithm for a real scenario
- A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints
- The bi-objective insular traveling salesman problem with maritime and ground transportation costs
- The balanced traveling salesman problem
- A branch-and-cut algorithm for the capacitated profitable tour problem
- Efficient meta-heuristics for the multi-objective time-dependent orienteering problem
- Heuristics for the time dependent team orienteering problem: application to tourist route planning
- The multi-district team orienteering problem
- Models for a Steiner ring network design problem with revenues
- Trip planning for visitors in a service system with capacity constraints
- The median tour and maximal covering tour problems: Formulations and heuristics
- Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
- A fast and effective heuristic for the orienteering problem
- A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application
- Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem
- Single string planning problem arising in liner shipping industries: a heuristic approach
- A stabilized column generation scheme for the traveling salesman subtour problem
- A path relinking approach for the team orienteering problem
- A tabu search heuristic for the undirected selective travelling salesman problem
- Multiobjective routing problems
- Robust UAV mission planning
- Evolution-inspired local improvement algorithm solving orienteering problem
- Solving the team orienteering problem with cutting planes
- Time constrained maximal covering salesman problem with weighted demands and partial coverage
- A revisited branch-and-cut algorithm for large-scale orienteering problems
- Selected combinatorial problems of computational biology
- The multi-vehicle profitable pickup and delivery problem
- The attractive traveling salesman problem
- Routing problems: A bibliography
- Using artificial neural networks to solve the orienteering problem
- Column generation based heuristics for a generalized location routing problem with profits arising in space exploration
- The team orienteering problem with time windows: an LP-based granular variable neighborhood search
- Clustered coverage orienteering problem of unmanned surface vehicles for water sampling
- A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
- The time-dependent capacitated profitable tour problem with time windows and precedence constraints
- A TSSP+1 decomposition strategy for the vehicle routing problem
- Multiperiod integrated spare parts and tour planning for on-site maintenance activities with stochastic repair requests
- Managing platelet supply through improved routing of blood collection vehicles
- Strong linear programming relaxations for the orienteering problem
- Solving the team orienteering arc routing problem with a column generation approach
- A TABU search heuristic for the team orienteering problem
- Formulations for the orienteering problem with additional constraints
- Hybrid genetic algorithm for undirected traveling salesman problems with profits
- On the nucleolus of the basic vehicle routing game
- Multi-objective vehicle routing problems
- Tabu search for DNA sequencing with false negatives and false positives
- On symmetric subtour problems
- A variable neighborhood search algorithm for cost-balanced travelling salesman problem
- Selective generalized travelling salesman problem
- The selective traveling salesman problem with emission allocation rules
- Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans
This page was built for publication: The selective travelling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q910347)
