A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem
From MaRDI portal
Cited in
(21)- Theory and applications of generalized dynamic programming: An overview
- Some comments on preference order dynamic programming models
- Stochastic vehicle routing
- The Steiner traveling salesman problem with online advanced edge blockages
- A traveling salesman problem with pickups and deliveries and stochastic travel times: an application from chemical shipping
- Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries
- Target-level criterion in Markov decision processes
- A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times
- Dynamic journeying under uncertainty
- A cutting plane method for risk-constrained traveling salesman problem with random arc costs
- Routing optimization with time windows under uncertainty
- Uncertain multiobjective traveling salesman problem
- A two-stage vehicle routing model for large-scale bioterrorism emergencies
- Data-driven approaches for emissions-minimized paths in urban areas
- A robust optimization approach to dispatching technicians under stochastic service times
- Interactive procedure for a multiobjective stochastic discrete dynamic problem
- Risky traveling salesman problem
- Robust data-driven vehicle routing with time windows
- A Solution Strategy for a Class of Nonlinear Knapsack Problems
- The traveling purchaser problem with stochastic prices: exact and approximate algorithms
- The orienteering problem with stochastic travel and service times
This page was built for publication: A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3853464)
