Online traveling salesman problems with rejection options
From MaRDI portal
Publication:4642471
DOI10.1002/net.21559zbMath1390.90069OpenAlexW2046731583MaRDI QIDQ4642471
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
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (9)
From Cost Sharing Mechanisms to Online Selection Problems ⋮ Online optimisation for ambulance routing in disaster response with partial or no information on victim conditions ⋮ Tight analysis of the lazy algorithm for open online dial-a-ride ⋮ An improved algorithm for open online dial-a-ride ⋮ Dynamic Traveling Repair Problem with an Arbitrary Time Window ⋮ Online in-time service problem with minimal server assignment ⋮ Supply Chain Management with Online Customer Selection ⋮ Pricing and allocation algorithm designs in dynamic ridesharing system ⋮ Relaxing the irrevocability requirement for online graph algorithms
This page was built for publication: Online traveling salesman problems with rejection options
