Algorithmic Applications in Management
From MaRDI portal
Publication:5710102
DOI10.1007/B137095zbMATH Open1120.90305OpenAlexW2505140176MaRDI QIDQ5710102FDOQ5710102
Authors: Fanglei Yi, Lei Tian 
Publication date: 30 November 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b137095
Recommendations
Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06)
Cited In (20)
- Approximation and Online Algorithms
- On-line single-server dial-a-ride problems
- Title not available (Why is that?)
- Serving rides of equal importance for time-limited dial-a-ride
- Title not available (Why is that?)
- On-line dial-a-ride problems under a restricted information model
- Earliest deadline first is a 2-approximation for DARP with time windows
- Car-sharing between two locations: online scheduling with flexible advance bookings
- Online dial-a-ride problem with time windows: an exact algorithm using status vectors
- An improved algorithm for open online dial-a-ride
- Online Dial-A-Ride Problem with Time-Windows Under a Restricted Information Model
- Title not available (Why is that?)
- Stability with Uniform Bounds for On-line Dial-a-Ride Problems under Reasonable Load
- Typology and literature review for dial-a-ride problems
- From theory to practice: maximizing revenues for on-line dial-a-ride
- Improved bounds for open online dial-a-ride on the line
- Tight competitive analyses of online car-sharing problems
- Tight analysis of the Smartstart algorithm for online dial-a-ride on the line
- Tight analysis of the Smartstart algorithm for online dial-a-ride on the line
- Improved bounds for revenue maximization in time-limited online dial-a-ride
This page was built for publication: Algorithmic Applications in Management
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710102)
