Online traveling salesman problems with rejection options
From MaRDI portal
Publication:4642471
DOI10.1002/NET.21559zbMATH Open1390.90069OpenAlexW2046731583MaRDI QIDQ4642471FDOQ4642471
Authors: Patrick Jaillet, Xin Lu 
Publication date: 23 May 2018
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21559
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cited In (15)
- Tight analysis of the lazy algorithm for open online dial-a-ride
- Online traveling salesman problems with service flexibility
- Supply chain management with online customer selection
- Pricing and allocation algorithm designs in dynamic ridesharing system
- Dynamic traveling repair problem with an arbitrary time window
- Online in-time service problem with minimal server assignment
- Online optimisation for ambulance routing in disaster response with partial or no information on victim conditions
- Algorithms for the on-line quota traveling salesman problem
- The online prize-collecting traveling salesman problem
- An improved algorithm for open online dial-a-ride
- Computing and Combinatorics
- From cost sharing mechanisms to online selection problems
- Online traveling salesman problem with deadlines and service flexibility
- Online traveling salesman problem with time cost and non-zealous server
- The online TSP against fair adversaries
This page was built for publication: Online traveling salesman problems with rejection options
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4642471)
