Online traveling salesman problems with service flexibility
From MaRDI portal
Publication:3100693
DOI10.1002/NET.20454zbMATH Open1229.90164OpenAlexW2132632316MaRDI QIDQ3100693FDOQ3100693
Authors: Patrick Jaillet, Xin Lu 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Online algorithms. The state of the art
- Competitive snoopy caching
- Title not available (Why is that?)
- Title not available (Why is that?)
- The online TSP against fair adversaries
- Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
- Algorithms for the on-line travelling salesman
- Algorithms for the on-line quota traveling salesman problem
- The online prize-collecting traveling salesman problem
- Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
- Competitive analysis for dynamic multiperiod uncapacitated routing problems
- Constructing competitive tours from local information
- Combinatorial optimization. Theory and algorithms.
- Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
- On-line single-server dial-a-ride problems
- On the power of lookahead in on-line server routing problems
Cited In (16)
- Two short notes on the on-line travelling salesman: handling times and lookahead.
- 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
- A simulated annealing algorithm for the restricted stochastic traveling salesman problem with exponentially distributed arc lengths
- New multi-objective optimization model for tourism systems with fuzzy data and new algorithm for solving this model
- Algorithms for the on-line travelling salesman
- The Steiner traveling salesman problem with online edge blockages
- Heuristics for dynamic and stochastic routing in industrial shipping
- An improved algorithm for open online dial-a-ride
- A stochastic algorithm for online bipartite resource allocation problems
- Competitive algorithms for the on-line traveling salesman
- Online traveling salesman problems with rejection options
- Online traveling salesman problem with deadlines and service flexibility
- Online traveling salesman problem with time cost and non-zealous server
- From theory to practice: maximizing revenues for on-line dial-a-ride
- The post-disaster debris clearance problem under incomplete information
This page was built for publication: Online traveling salesman problems with service flexibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3100693)
