Han Li

Han Li

Auto-generated profile, based on publicly available information

Han Li

Alibaba Group Beijing

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 October 2024 in Transportation Research Part D: Transport and Environment
Verified
Journal Article
Closed access
HQHaohao Qu
Haohao Qu
HLHan Li
Han Li
Linlin YouLinlin You
Linlin You
Rui ZhuRui Zhu
Rui Zhu
JYJinyue Yan
Jinyue Yan
CYChau Yuen
Chau Yuen

1 March 2018 in Information Systems Management
Verified
Journal Article
Closed access
XLXin (Robert) Luo
Xin (Robert) Luo
Wei ZhangWei Zhang
Wei Zhang
RBRanjit Bose
Ranjit Bose
HLHan Li
Han Li
QCQ B Chung
Q B Chung
To determine the viability of cloud computing as a source of competitive advantage, we integrate the theory of diffusion of innovations and the theory of dynamic capabilities to synthesize the strengths of these theories into a framework. The theoretical framework with 13 propositions would enhance conceptual understanding of strategic initialization of cloud computing and its outcomes and should serve as a foundation for further theoretical and empirical investigations.

12 May 2020 in arXiv
Verified
Preprint
Open access
PDF file
XHXiaotian Hao
Xiaotian Hao
JJJunqi Jin
Junqi Jin
HJHao JianYe
Hao JianYe
JLJin Li
Jin Li
WWWeixun Wang
Weixun Wang
KGKun Gai
Kun Gai
Bipartite b-matching is fundamental in algorithm design, and has been widely applied into economic markets, labor markets, etc. These practical problems usually exhibit two distinct features: large-scale and dynamic, which requires the matching algorithm to be repeatedly executed at regular intervals. However, existing exact and approximate algorithms usually fail in such settings due to either requiring intolerable running time or too much computation resource. To address this issue, we propose \texttt{NeuSearcher} which leverages the knowledge learned from previously instances to solve new problem instances. Specifically, we design a multichannel graph neural network to predict the threshold of the matched edges weights, by which the search region could be significantly reduced. We further propose a parallel heuristic search algorithm to iteratively improve the solution quality until convergence. Experiments on both open and industrial datasets demonstrate that \texttt{NeuSearcher} can speed up 2 to 3 times while achieving exactly the same matching solution compared with the state-of-the-art approximation approaches.