Pages that link to "Item:Q5958715"
From MaRDI portal
The following pages link to On-line single-server dial-a-ride problems (Q5958715):
Displaying 39 items.
- Improving LTL truck load utilization on line (Q531465) (← links)
- Algorithms for the on-line quota traveling salesman problem (Q834904) (← links)
- Online \(k\)-server routing problems (Q839628) (← 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)
- New lower bounds for online \(k\)-server routing problems (Q987824) (← links)
- A new formulation for the traveling deliveryman problem (Q1003469) (← links)
- Dynamic pickup and delivery problems (Q1038370) (← links)
- News from the online traveling repairman. (Q1401247) (← links)
- Online spatio-temporal matching in stochastic and dynamic domains (Q1648078) (← links)
- Typology and literature review for dial-a-ride problems (Q1698288) (← links)
- From theory to practice: maximizing revenues for on-line dial-a-ride (Q1702834) (← links)
- Energy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling system (Q1751731) (← links)
- Algorithms for on-line order batching in an order picking warehouse (Q1761193) (← links)
- Improved bounds for revenue maximization in time-limited online dial-a-ride (Q1981946) (← links)
- The online food delivery problem on stars (Q2079861) (← links)
- Online pickup and delivery problem with constrained capacity to minimize latency (Q2156283) (← links)
- Pricing and allocation algorithm designs in dynamic ridesharing system (Q2283011) (← 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)
- Improved bounds for open online dial-a-ride on the line (Q2701389) (← links)
- Dynamic Traveling Repair Problem with an Arbitrary Time Window (Q2971153) (← links)
- Almost sure asymptotic optimality for online routing and machine scheduling problems (Q3057128) (← links)
- Online traveling salesman problems with service flexibility (Q3100693) (← links)
- The Post-Disaster Debris Clearance Problem Under Incomplete Information (Q3195231) (← links)
- Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line (Q3300763) (← links)
- Online Vehicle Routing Problems: A Survey (Q3564358) (← links)
- New Bounds for Maximizing Revenue in Online Dial-a-Ride (Q5041189) (← links)
- (Q5090461) (← links)
- An Improved Online Algorithm for the Traveling Repairperson Problem on a Line (Q5092364) (← links)
- On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis (Q5323061) (← links)
- (Q5875473) (← links)
- Euler is standing in line dial-a-ride problems with precedence-constraints (Q5948963) (← links)
- Minimizing the maximum flow time in the online food delivery problem (Q6130315) (← links)
- An improved algorithm for open online dial-a-ride (Q6176557) (← links)
- Maximizing the number of rides served for time-limited Dial-a-Ride* (Q6661115) (← links)