Pages that link to "Item:Q5057434"
From MaRDI portal
The following pages link to Competitive algorithms for the on-line traveling salesman (Q5057434):
Displaying 19 items.
- Optimal deterministic algorithms for some variants of online quota traveling salesman problem (Q296870) (← links)
- Online traveling salesman problem with deadlines and service flexibility (Q498429) (← links)
- Algorithms for the on-line quota traveling salesman problem (Q834904) (← links)
- The on-line asymmetric traveling salesman problem (Q935844) (← links)
- The online prize-collecting traveling salesman problem (Q963439) (← links)
- News from the online traveling repairman. (Q1401247) (← links)
- Two short notes on the on-line travelling salesman: handling times and lookahead. (Q1853561) (← links)
- Exact distributional analysis of online algorithms with lookahead (Q2044551) (← links)
- Online traveling salesman problem with time cost and non-zealous server (Q2082223) (← links)
- Competitive analysis for the on-line truck transportation problem (Q2494309) (← links)
- The online TSP against fair adversaries (Q2884500) (← links)
- Online traveling salesman problems with service flexibility (Q3100693) (← links)
- Discrete online TSP (Q3638442) (← links)
- (Q3821971) (← links)
- Computing and Combinatorics (Q4681188) (← links)
- Serving requests with on-line routing (Q5056164) (← links)
- An Improved Online Algorithm for the Traveling Repairperson Problem on a Line (Q5092364) (← links)
- Algorithms and Data Structures (Q5394259) (← links)
- Algorithms for the on-line travelling salesman (Q5943663) (← links)