Pages that link to "Item:Q5898478"
From MaRDI portal
The following pages link to Approximation and Online Algorithms (Q5898478):
Displaying 16 items.
- Typology and literature review for dial-a-ride problems (Q1698288) (← 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)
- Tight competitive analyses of online car-sharing problems (Q2089695) (← links)
- Improved bounds for open online dial-a-ride on the line (Q2701389) (← links)
- Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line (Q3300763) (← links)
- New Bounds for Maximizing Revenue in Online Dial-a-Ride (Q5041189) (← links)
- (Q5090461) (← links)
- Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings. (Q5091058) (← links)
- An Improved Online Algorithm for the Traveling Repairperson Problem on a Line (Q5092364) (← links)
- (Q5875473) (← links)
- Car-sharing between two locations: online scheduling with flexible advance bookings (Q5896897) (← links)
- Online car-sharing problem with variable booking times (Q6126815) (← links)
- Minimizing the maximum flow time in the online food delivery problem (Q6130315) (← links)
- Maximizing the number of rides served for time-limited Dial-a-Ride* (Q6661115) (← links)
