default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLing Gai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Ling Gai, Mengpei Liang, Chenhao Wang
:
Two-facility-location games with mixed types of agents. Appl. Math. Comput. 466: 128479 (2024)- [j17]Min Cui, Donglei Du, Ling Gai, Ruiqi Yang:
Improved Linear-Time Streaming Algorithms for Maximizing Monotone Cardinality-Constrained Set Functions. Int. J. Found. Comput. Sci. 35(6): 631-650 (2024) - [j16]Hongxiang Zhang, Dachuan Xu, Ling Gai, Zhenning Zhang:
Online learning under one sided σ-smooth function. J. Comb. Optim. 47(5): 76 (2024) - [j15]Ling Gai, Weiwei Zhang, Zhao Zhang:
Selfish bin packing with punishment. Theor. Comput. Sci. 982: 114276 (2024) - 2023
- [j14]Yunhe Xu, Chenchen Wu, Ling Gai, Lu Han:
Effective Heuristic Techniques for Combined Robust Clustering Problem. Asia Pac. J. Oper. Res. 40(1): 2240009:1-2240009:17 (2023) - [j13]Xiaoyun Tian, Ling Gai, Yicheng Xu, Dongmei Zhang:
Approximation Algorithms for Spherical k-Means Problem with Penalties Using Local Search Techniques. Asia Pac. J. Oper. Res. 40(1): 2240014:1-2240014:16 (2023) - [j12]Ling Gai, Hu-chen Liu, Yanjun Wang, Yuping Xing:
Green supplier selection and order allocation using linguistic Z-numbers MULTIMOORA method and bi-objective non-linear programming. Fuzzy Optim. Decis. Mak. 22(2): 267-288 (2023) - [j11]Ling Gai, Mengpei Liang, Chenhao Wang:
Discrete facility location games with different preferences. J. Comb. Optim. 46(2): 17 (2023) - 2022
- [j10]Xiaoyun Tian, Dachuan Xu, Donglei Du, Ling Gai:
The spherical k-means++ algorithm via local search scheme. J. Comb. Optim. 44(4): 2375-2394 (2022) - [j9]Ling Gai, Ying Jin, Binyuan Zhang:
An integrated method for hybrid distribution with estimation of demand matching degree. J. Comb. Optim. 44(4): 2782-2808 (2022) - [j8]Ling Gai, Chenchen Wu, Dachuan Xu, Weiwei Zhang:
Selfish bin packing under Harmonic mean cost sharing mechanism. Optim. Lett. 16(5): 1445-1456 (2022) - [c10]Ling Gai, Mengpei Liang, Chenhao Wang:
Obnoxious Facility Location Games with Candidate Locations. AAIM 2022: 96-105 - [c9]Hongxiang Zhang, Dachuan Xu, Ling Gai, Zhenning Zhang:
Online One-Sided Smooth Function Maximization. COCOON 2022: 177-185 - [c8]Ling Gai, Dandan Qian, Chenchen Wu:
Two-Facility Location Games with Distance Requirement. FAW 2022: 15-24 - 2021
- [j7]Ling Gai, Zhiyue Peng, Jiming Zhang, Jiafu Zhang:
Emergency medical center location problem with people evacuation solved by extended TODIM and objective programming. J. Comb. Optim. 42(4): 1004-1029 (2021) - [c7]Ling Gai, Weiwei Zhang, Wenchang Luo, Yukun Cheng:
On Various Open-End Bin Packing Game. COCOA 2021: 86-95 - [c6]Min Cui, Donglei Du, Ling Gai, Ruiqi Yang:
A Linear-Time Streaming Algorithm for Cardinality-Constrained Maximizing Monotone Non-submodular Set Functions. COCOA 2021: 96-110 - 2020
- [c5]Sai Ji, Dachuan Xu, Donglei Du, Ling Gai:
Approximation Algorithm for the Balanced 2-correlation Clustering Problem on Well-Proportional Graphs. AAIM 2020: 97-107 - [c4]Xiaoyun Tian, Dachuan Xu, Donglei Du, Ling Gai:
The Spherical k-means++ Algorithm via Local Search. AAIM 2020: 131-140 - [c3]Weiwei Zhang, Alin Gao, Ling Gai:
Selfish Bin Packing with Parameterized Punishment. AAIM 2020: 238-247 - [c2]Ling Gai, Ying Jin, Binyuan Zhang:
Mixed Distribution of Relief Materials with the Consideration of Demand Matching Degree. AAIM 2020: 627-638
2010 – 2019
- 2019
- [j6]Ling Gai, Jiandong Ji:
An integrated method to solve the healthcare facility layout problem under area constraints. J. Comb. Optim. 37(1): 95-113 (2019) - 2018
- [j5]Ling Gai, Guochuan Zhang:
Online lazy bureaucrat scheduling with a machine deadline. J. Comb. Optim. 35(2): 530-537 (2018) - [j4]Huijuan Wang, Bin Liu, Ling Gai, Hongwei Du, Jianliang Wu:
Minimum choosability of planar graphs. J. Comb. Optim. 36(1): 13-22 (2018) - [j3]Ling Gai, Hongwei Du, Lidong Wu, Junlei Zhu, Yuehua Bu:
Blocking Rumor by Cut. J. Comb. Optim. 36(2): 392-399 (2018)
2000 – 2009
- 2009
- [j2]Ling Gai, Guochuan Zhang:
Hardness of lazy packing and covering. Oper. Res. Lett. 37(2): 89-92 (2009) - 2008
- [j1]Ling Gai, Guochuan Zhang:
On lazy bureaucrat scheduling with common deadlines. J. Comb. Optim. 15(2): 191-199 (2008) - 2006
- [c1]Ling Gai, Guochuan Zhang:
Common Deadline Lazy Bureaucrat Scheduling Revisited. LATIN 2006: 515-523
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
