Online traveling salesman problems with rejection options

DOI10.1002/NET.21559MaRDI QIDQ4642471zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

onlinecompetitive analysistraveling salesman problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)

Recommendations

• Online traveling salesman problems with service flexibility
• Algorithms for the on-line travelling salesman
• Online traveling salesman problem with deadlines and service flexibility
• Competitive algorithms for the on-line traveling salesman
• The online TSP against fair adversaries

Cited in

(15)

• Online traveling salesman problems with service flexibility
• Tight analysis of the lazy algorithm for open online dial-a-ride
• Pricing and allocation algorithm designs in dynamic ridesharing system
• Supply chain management with online customer selection
• 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
• Online traveling salesman problem with deadlines and service flexibility
• From cost sharing mechanisms to online selection problems
• 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)