Online traveling salesman problems with service flexibility

DOI10.1002/net.20454zbMath1229.90164OpenAlexW2132632316MaRDI QIDQ3100693

Xin Lu, Patrick Jaillet

Publication date: 21 November 2011

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20454

zbMATH Keywords

traveling salesmanonline algorithmsprize-collecting

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items

The Steiner traveling salesman problem with online edge blockages, A simulated annealing algorithm for the restricted stochastic traveling salesman problem with exponentially distributed arc lengths, Heuristics for dynamic and stochastic routing in industrial shipping, A stochastic algorithm for online bipartite resource allocation problems, The Post-Disaster Debris Clearance Problem Under Incomplete Information, New multi-objective optimization model for tourism systems with fuzzy data and new approach developed epsilon constraint method, Tight analysis of the lazy algorithm for open online dial-a-ride, An improved algorithm for open online dial-a-ride, From theory to practice: maximizing revenues for on-line dial-a-ride, Online traveling salesman problem with deadlines and service flexibility, Online traveling salesman problem with time cost and non-zealous server, New multi-objective optimization model for tourism systems with fuzzy data and new algorithm for solving this model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for the on-line quota traveling salesman problem
• On the power of lookahead in on-line server routing problems
• The online prize-collecting traveling salesman problem
• Online algorithms. The state of the art
• Competitive snoopy caching
• Constructing competitive tours from local information
• Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
• The Online TSP Against Fair Adversaries
• Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
• Competitive analysis for dynamic multiperiod uncapacitated routing problems
• Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
• Combinatorial optimization. Theory and algorithms.
• Algorithms for the on-line travelling salesman
• On-line single-server dial-a-ride problems