No. | Title | Author | Year |
---|---|---|---|
1 | Connected k-Center and k-Diameter Clustering | Drexler, Lukas et al. | 2023 |
2 | Minimizing the Maximum Flow Time in the Online Food Delivery Problem | Guo, Xiangyu et al. | 2022 |
3 | Package Delivery Using Drones with Restricted Movement Areas | Erlebach, Thomas et al. | 2022 |
4 | Car-Sharing on a Star Network: On-Line Scheduling with k Servers | Luo, Kelin et al. | 2019 |
5 | Two Moves per Time Step Make a Difference | Erlebach, Thomas et al. | 2019 |
6 | Car-Sharing between Two Locations: Online Scheduling with Two Servers | Luo, Kelin et al. | 2018 |
7 | Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings | Luo, Kelin et al. | 2018 |
Current Page : | |
Number of result pages: | 1 |
Number of documents: | 7 |