Traveling salesman problems with profits and stochastic customers
From MaRDI portal
Publication:5374522
Recommendations
- Algorithms for a stochastic selective travelling salesperson problem
- Solving a generalized traveling salesperson problem with stochastic customers
- scientific article; zbMATH DE number 4066604
- A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
- Analysis of the selective traveling salesman problem with time-dependent profits
Cited in
(21)- Multiperiod integrated spare parts and tour planning for on-site maintenance activities with stochastic repair requests
- Solving a generalized traveling salesperson problem with stochastic customers
- The traveling purchaser problem with stochastic prices: exact and approximate algorithms
- A progressive hedging method for the multi-path travelling salesman problem with stochastic travel times
- A matheuristic algorithm for the pollution and energy minimization traveling salesman problems
- scientific article; zbMATH DE number 4160472 (Why is no real title available?)
- An adaptive large neighborhood search approach for multiple traveling repairman problem with profits
- Customer selection and profit maximization in vehicle routing problems
- Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers
- Algorithms for a stochastic selective travelling salesperson problem
- Maximal covering salesman problems with average travelling cost constraints
- scientific article; zbMATH DE number 19253 (Why is no real title available?)
- The attractive traveling salesman problem
- Solving the probabilistic profitable tour problem on a line
- A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
- Analysis of the selective traveling salesman problem with time-dependent profits
- The risk-averse traveling repairman problem with profits
- scientific article; zbMATH DE number 7368819 (Why is no real title available?)
- Route recombination for deterministic and non-deterministic orienteering problems with time windows: a dynamic programming approach
- The probabilistic travelling salesman problem with crowdsourcing
- Complexity and approximation for traveling salesman problems with profits
This page was built for publication: Traveling salesman problems with profits and stochastic customers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5374522)