On-line single-server dial-a-ride problems
From MaRDI portal
Recommendations
Cites work
- Algorithms for the on-line travelling salesman
- Computer-aided complexity classification of dial-a-ride problems
- Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
- scientific article; zbMATH DE number 1094690 (Why is no real title available?)
- Nonpreemptive Ensemble Motion Planning on a Tree
- Preemptive Ensemble Motion Planning on a Tree
- Routing a vehicle of capacity greater than one
- Scheduling jobs that arrive over time
- Scheduling Parallel Machines On-Line
- Searching in the plane
- The General Pickup and Delivery Problem
- The minimum latency problem
Cited in
(55)- A new formulation for the traveling deliveryman problem
- Dynamic pickup and delivery problems
- News from the online traveling repairman.
- Online spatio-temporal matching in stochastic and dynamic domains
- Typology and literature review for dial-a-ride problems
- From theory to practice: maximizing revenues for on-line dial-a-ride
- Energy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling system
- Algorithms for on-line order batching in an order picking warehouse
- On-line dial-a-ride problems under a restricted information model
- Improved bounds for revenue maximization in time-limited online dial-a-ride
- The online food delivery problem on stars
- Serving rides of equal importance for time-limited dial-a-ride
- Online pickup and delivery problem with constrained capacity to minimize latency
- Pricing and allocation algorithm designs in dynamic ridesharing system
- The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
- Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models
- How to whack moles
- Improved bounds for open online dial-a-ride on the line
- scientific article; zbMATH DE number 1629830 (Why is no real title available?)
- scientific article; zbMATH DE number 1629851 (Why is no real title available?)
- Dynamic traveling repair problem with an arbitrary time window
- Almost sure asymptotic optimality for online routing and machine scheduling problems
- Online traveling salesman problems with service flexibility
- The post-disaster debris clearance problem under incomplete information
- Tight analysis of the Smartstart algorithm for online dial-a-ride on the line
- Online Vehicle Routing Problems: A Survey
- Hardness of Preemptive Finite Capacity Dial-a-Ride
- scientific article; zbMATH DE number 1947431 (Why is no real title available?)
- Competitive analysis of the online dial-a-ride problem
- New Bounds for Maximizing Revenue in Online Dial-a-Ride
- Tight analysis of the Smartstart algorithm for online dial-a-ride on the line
- An improved online algorithm for the traveling repairperson problem on a line
- Improving LTL truck load utilization on line
- On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis
- Online Dial-A-Ride Problem with Time-Windows Under a Restricted Information Model
- Algorithmic Applications in Management
- scientific article; zbMATH DE number 7650088 (Why is no real title available?)
- Approximation and Online Algorithms
- Euler is standing in line dial-a-ride problems with precedence-constraints
- Algorithms for online car-sharing problem
- Minimizing the maximum flow time in the online food delivery problem
- Tight analysis of the lazy algorithm for open online dial-a-ride
- An improved algorithm for open online dial-a-ride
- Maximizing the number of rides served for time-limited Dial-a-Ride*
- Tight analysis of the lazy algorithm for open online dial-a-ride
- Competitive perimeter defense in linear environments
- Traveling repairperson, unrelated machines, and other stories about average completion times
- Scheduling on identical machines with setup time and unknown execution time
- Algorithms for the on-line quota traveling salesman problem
- Online k-server routing problems
- On multi-threaded metrical task systems
- A hard dial-a-ride problem that is easy on average
- The on-line asymmetric traveling salesman problem
- On the power of lookahead in on-line server routing problems
- New lower bounds for online k-server routing problems
This page was built for publication: On-line single-server dial-a-ride problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958715)
