Pages that link to "Item:Q1882408"
From MaRDI portal
The following pages link to Online and offline algorithms for the time-dependent TSP with time zones (Q1882408):
Displaying 11 items.
- TSP race: minimizing completion time in time-sensitive applications (Q319282) (← links)
- Approximation algorithms for time-dependent orienteering. (Q1853044) (← links)
- Online traveling salesman problem with time cost and non-zealous server (Q2082223) (← links)
- On temporal graph exploration (Q2662667) (← links)
- Parameterised temporal exploration problems (Q2698289) (← links)
- Discrete online TSP (Q3638442) (← links)
- Faster exploration of degree-bounded temporal graphs (Q5005137) (← links)
- (Q5092344) (← links)
- Non-strict Temporal Exploration (Q5100955) (← links)
- Exploration of \(k\)-edge-deficient temporal graphs (Q5896891) (← links)
- Exploration of \(k\)-edge-deficient temporal graphs (Q5918789) (← links)