default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQingqin Nong
Person information
- affiliation: Ocean University of China, Department of Mathematics, Qingdao, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]Qi Zhao, Wenjing Liu
, Qingqin Nong, Qizhi Fang:
Constrained heterogeneous two-facility location games with sum-variant. J. Comb. Optim. 47(4): 65 (2024)- [j28]Suning Gong, Qingqin Nong, Yue Wang, Dingzhu Du:
Budget-constrained profit maximization without non-negative objective assumption in social networks. J. Glob. Optim. 90(4): 1007-1030 (2024) - [j27]Suning Gong, Qingqin Nong, Jiazhu Fang, Ding-Zhu Du:
Algorithms for Cardinality-Constrained Monotone DR-Submodular Maximization with Low Adaptivity and Query Complexity. J. Optim. Theory Appl. 200(1): 194-214 (2024) - [c9]Yuanyuan Wang, Xin Chen, Qizhi Fang, Qingqin Nong, Wenjing Liu:
Finding Fair and Efficient Allocations Under Budget Constraints. IJTCS-FAW 2024: 144-158 - [c8]Jiazhu Fang, Qizhi Fang, Wenjing Liu, Qingqin Nong:
Mechanism Design with Predictions for Facility Location Games with Candidate Locations. TAMC 2024: 38-49 - [i2]Yuanyuan Wang, Xin Chen, Qingqin Nong:
The Fairness of Maximum Nash Social Welfare Under Matroid Constraints and Beyond. CoRR abs/2411.01462 (2024) - 2023
- [j26]Qingqin Nong, Zhijia Guo, Suning Gong:
Regularized Submodular Maximization With a k-Matroid Intersection Constraint. IEEE Access 11: 103830-103838 (2023) - [j25]Qingqin Nong, Chenchen Wu, Dachuan Xu, Dongmei Zhang:
Preface. Asia Pac. J. Oper. Res. 40(1): 2302001:1-2302001:2 (2023) - [j24]Suning Gong, Qingqin Nong, Han Xiao, Ding-Zhu Du:
Uncertainty in Study of Social Networks: Robust Optimization and Machine Learning. Asia Pac. J. Oper. Res. 40(1): 2340006:1-2340006:16 (2023) - [j23]Jiwen Chen, Qingqin Nong, Yuanyuan Wang, Wenjing Liu:
Maximize Liquid Welfare in Combinatorial Auctions with Monotone Valuations. Asia Pac. J. Oper. Res. 40(4): 2340010:1-2340010:13 (2023) - [j22]Qi Zhao, Wenjing Liu, Qingqin Nong, Qizhi Fang:
Constrained heterogeneous facility location games with max-variant cost. J. Comb. Optim. 45(3): 90 (2023) - [j21]Suning Gong, Qingqin Nong, Shuyu Bao, Qizhi Fang, Ding-Zhu Du:
A fast and deterministic algorithm for Knapsack-constrained monotone DR-submodular maximization over an integer lattice. J. Glob. Optim. 85(1): 15-38 (2023) - 2022
- [j20]Xin Chen, Qizhi Fang, Wenjing Liu, Yuan Ding, Qingqin Nong:
Strategyproof mechanisms for 2-facility location games with minimax envy. J. Comb. Optim. 43(5): 1628-1644 (2022) - [j19]Xin Chen, Wenjing Liu, Qingqin Nong, Qizhi Fang:
Bounding quality of pure Nash equilibria in dual-role facility location games. J. Comb. Optim. 44(5): 3520-3534 (2022) - [c7]Qi Zhao, Wenjing Liu, Qizhi Fang, Qingqin Nong:
Constrained Heterogeneous Two-Facility Location Games with Max-Variant Cost. FAW 2022: 25-43 - [i1]Qi Zhao, Wenjing Liu, Qizhi Fang, Qingqin Nong:
Constrained Heterogeneous Two-facility Location Games with Max-variant Cost. CoRR abs/2207.03026 (2022) - 2021
- [j18]Xin Chen, Qingqin Nong, Qizhi Fang:
An improved mechanism for selfish bin packing. J. Comb. Optim. 42(3): 636-656 (2021) - [j17]Suning Gong, Qingqin Nong, Tao Sun, Qizhi Fang, Ding-Zhu Du, Xiaoyu Shao:
Maximize a monotone function with a generic submodularity ratio. Theor. Comput. Sci. 853: 16-24 (2021) - [j16]Wenjing Liu, Yuan Ding, Xin Chen, Qizhi Fang, Qingqin Nong:
Multiple facility location games with envy ratio. Theor. Comput. Sci. 864: 1-9 (2021) - [c6]Yin Yang, Qingqin Nong, Suning Gong, Jingwen Du, Yumei Liang:
The Price of Anarchy of Generic Valid Utility Systems. COCOA 2021: 224-233 - 2020
- [j15]Yuan Ding, Wenjing Liu, Xin Chen, Qizhi Fang, Qingqin Nong:
Facility location game with envy ratio. Comput. Ind. Eng. 148: 106710 (2020) - [j14]Qingqin Nong, Jiazhu Fang, Suning Gong, Ding-Zhu Du, Yan Feng, Xiaoying Qu:
A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice. J. Comb. Optim. 39(4): 1208-1220 (2020) - [j13]Qizhi Fang, Xin Chen, Qingqin Nong, Zongchao Zhang, Yongchang Cao, Yan Feng, Tao Sun, Suning Gong, Ding-Zhu Du:
General Rumor Blocking: An efficient random algorithm with martingale approach. Theor. Comput. Sci. 803: 82-93 (2020) - [j12]Qingqin Nong, Jiazhu Fang, Suning Gong, Yan Feng, Xiaoying Qu:
A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function. Theor. Comput. Sci. 840: 177-186 (2020) - [c5]Wenjing Liu, Yuan Ding, Xin Chen, Qizhi Fang, Qingqin Nong:
Multiple Facility Location Games with Envy Ratio. AAIM 2020: 248-259 - [c4]Qingqin Nong, Suning Gong, Qizhi Fang, Ding-Zhu Du:
A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions. Complexity and Approximation 2020: 172-186
2010 – 2019
- 2019
- [j11]Qingqin Nong, Jiapeng Wang, Suning Gong, Saijun Guo:
A bin packing game with cardinality constraints under the best cost rule. Discret. Math. Algorithms Appl. 11(2): 1950022:1-1950022:12 (2019) - [j10]Suning Gong, Qingqin Nong, Wenjing Liu, Qizhi Fang:
Parametric monotone function maximization with matroid constraints. J. Glob. Optim. 75(3): 833-849 (2019) - [c3]Qingqin Nong, Tao Sun, Suning Gong, Qizhi Fang, Ding-Zhu Du, Xiaoyu Shao:
Maximize a Monotone Function with a Generic Submodularity Ratio. AAIM 2019: 249-260 - 2018
- [j9]Guoqiang Fan, Qingqin Nong:
A Coordination Mechanism for a Scheduling Game with Uniform-Batching Machines. Asia Pac. J. Oper. Res. 35(5): 1850033:1-1850033:15 (2018) - [j8]Qingqin Nong, Tao Sun, T. C. E. Cheng, Qizhi Fang:
Bin packing game with a price of anarchy of 3/2. J. Comb. Optim. 35(2): 632-640 (2018) - [c2]Qizhi Fang, Xin Chen, Qingqin Nong, Zongchao Zhang, Yongchang Cao, Yan Feng, Tao Sun, Suning Gong, Ding-Zhu Du:
General Rumor Blocking: An Efficient Random Algorithm with Martingale Approach. AAIM 2018: 161-176 - 2017
- [j7]Qingqin Nong, G. Q. Fan, Qizhi Fang:
A coordination mechanism for a scheduling game with parallel-batching machines. J. Comb. Optim. 33(2): 567-579 (2017) - [j6]Xin Chen, Qingqin Nong, Yan Feng, Yongchang Cao, Suning Gong, Qizhi Fang, Ker-I Ko:
Centralized and decentralized rumor blocking problems. J. Comb. Optim. 34(1): 314-329 (2017) - [c1]Xin Chen, Qingqin Nong, Qizhi Fang:
An Improved Mechanism for Selfish Bin Packing. COCOA (2) 2017: 241-257 - 2011
- [j5]Q. Q. Nong, T. C. E. Cheng, C. T. Ng:
Two-agent scheduling to minimize the total cost. Eur. J. Oper. Res. 215(1): 39-44 (2011) - 2010
- [j4]Q. Q. Nong, T. C. Edwin Cheng, C. T. Ng:
A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting. Theor. Comput. Sci. 411(31-33): 2978-2986 (2010)
2000 – 2009
- 2009
- [j3]Qingqin Nong, Jinjiang Yuan, Yixun Lin:
The weighted link ring loading problem. J. Comb. Optim. 18(1): 38-50 (2009) - 2008
- [j2]Q. Q. Nong, C. T. Ng, T. C. Edwin Cheng:
The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan. Oper. Res. Lett. 36(1): 61-66 (2008) - [j1]Q. Q. Nong, T. C. Edwin Cheng, C. T. Ng:
An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines. Oper. Res. Lett. 36(5): 584-588 (2008)
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 2025-01-21 00:00 CET 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:
