Pages that link to "Item:Q5958715"
From MaRDI portal
The following pages link to On-line single-server dial-a-ride problems (Q5958715):
Displayed 12 items.
- Algorithms for the on-line quota traveling salesman problem (Q834904) (← links)
- On multi-threaded metrical task systems (Q849631) (← links)
- A hard dial-a-ride problem that is easy on average (Q880497) (← links)
- The on-line asymmetric traveling salesman problem (Q935844) (← links)
- On the power of lookahead in on-line server routing problems (Q959800) (← links)
- A new formulation for the traveling deliveryman problem (Q1003469) (← links)
- News from the online traveling repairman. (Q1401247) (← links)
- The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments (Q2455616) (← links)
- Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models (Q2500540) (← links)
- How to whack moles (Q2503357) (← links)
- On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis (Q5323061) (← links)
- Euler is standing in line dial-a-ride problems with precedence-constraints (Q5948963) (← links)