Kelin Luo

Orcid: 0000-0003-2006-0601

According to our database1, Kelin Luo authored at least 28 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Online car-sharing problem with variable booking times.
J. Comb. Optim., April, 2024

Minimizing the Maximum Flow Time in the Online Food Delivery Problem.
Algorithmica, April, 2024

2023
A Hierarchical Grouping Algorithm for the Multi-Vehicle Dial-a-Ride Problem.
Proc. VLDB Endow., 2023

Solving large-scale dynamic vehicle routing problems with stochastic requests.
Eur. J. Oper. Res., 2023

Online generalized assignment problem with historical information.
Comput. Oper. Res., 2023

Connected k-Center and k-Diameter Clustering.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
The online food delivery problem on stars.
Theor. Comput. Sci., 2022

Learn from history for online bipartite matching.
J. Comb. Optim., 2022

Online scheduling of car-sharing request pairs between two locations.
J. Comb. Optim., 2022

Online crowdsourced truck delivery using historical information.
Eur. J. Oper. Res., 2022

Car-sharing between two locations: Online scheduling with flexible advance bookings.
Discret. Appl. Math., 2022

Minimizing Travel Time and Latency in Multi-Capacity Ride-Sharing Problems.
Algorithms, 2022

The Multi-vehicle Ride-Sharing Problem.
Proceedings of the WSDM '22: The Fifteenth ACM International Conference on Web Search and Data Mining, Virtual Event / Tempe, AZ, USA, February 21, 2022

Package Delivery Using Drones with Restricted Movement Areas.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Algorithms for Online Car-Sharing Problem.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

2021
Online Food Delivery to Minimize Maximum Flow Time.
CoRR, 2021

Online Bin Packing with Overload Cost.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020
Approximation Algorithms for Car-Sharing Problems.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019
On-line scheduling with monotone subsequence constraints.
Theor. Comput. Sci., 2019

Car-Sharing on a Star Network: On-Line Scheduling with k Servers.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Two Moves per Time Step Make a Difference.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Car-Sharing Problem: Online Scheduling with Flexible Advance Bookings.
Proceedings of the Combinatorial Optimization and Applications, 2019

2018
Creating an acceptable consensus ranking for group decision making.
J. Comb. Optim., 2018

Car-Sharing between Two Locations: Online Scheduling with Two Servers.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017
On-line Scheduling with a Monotonous Subsequence Constraint.
Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

2016
Online Scheduling with Increasing Subsequence Serving Constraint.
Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

2015
The Minimum Acceptable Violation Ranking of Alternatives from Voters' Ordinal Rankings.
Proceedings of the Combinatorial Optimization and Applications, 2015


  Loading...