


default search action
Qian Liu 0016
Person information
- affiliation: Shandong Normal University, School of Mathematics and Statistics, Jinan, China
Other persons with the same name
- Qian Liu — disambiguation page
- Qian Liu 0001
— Dalian University of Technology, School of Computer Science and Technology, China (and 1 more) - Qian Liu 0002
— Hong Kong University of Science and Technology, Department of Industrial Engineering and Logistics Management, Hong Kong - Qian Liu 0003
— Huazhong University of Science and Technology, Hubei Bioinformatics and Molecular Imaging Key Laboratory, Wuhan, China - Qian Liu 0004
— Beijing University of Posts and Telecommunications, School of Information and Communication Engineering, China - Qian Liu 0005 — University of Manchester, UK (and 1 more)
- Qian Liu 0006 — Virginia Tech, Blacksburg, VA, USA
- Qian Liu 0007
— Wuhan University, School of Information Management, Wuhan, China - Qian Liu 0008
— Nanjing University of Science and Technology, School of Computer Science and Engineering, Nanjing, China - Qian Liu 0009
— Chongqing University of Posts and Telecommunications, School of Communication and Information Engineering, China (and 1 more)
- Qian Liu 0010 — Nanjing University of Information Science and Technology, School of Electronic and Information Engineering, Nanjing, China (and 1 more)
- Qian Liu 0011
— George Mason University, Department of Geography and Geoinformation Science, Fairfax, VA, USA - Qian Liu 0012
— University of Auckland, Auckland, New Zealand (and 3 more) - Qian Liu 0013
— Central University of Finance and Economics, Beijing, China (and 1 more) - Qian Liu 0014 — Nanyang Technological University, Singapore
- Qian Liu 0015
— University of Manitoba, Winnipeg, Canada - Qian Liu 0017
— Zhejiang University, Hangzhou, China - Qian Liu 0018
— Shandong Normal University, Jinan, China - Qian Liu 0019
— Institute of Oceanography, Chinese Academy of Sciences, Qingdao, Shandong, China - Qian Liu 0020
— Guangdong University of Technology, Guangzhou, China - Qian Liu 0021
— Nanyang Technological University, Singapore - Qian Liu 0022
— Harbin Institute of Technology, Harbin, Heilongjiang, China - Qian Liu 0023
— Beijing Normal University, Beijing, China - Qian Liu 0024
— University of Chinese Academy of Sciences, Beijing, China - Qian Liu 0025
— Yanshan University, Qinhuangdao, China - Qian Liu 0026
— University of Otago, Dunedin, New Zealand - Qian Liu 0027
— Shanxi University, Taiyuan, China - Qian Liu 0028
— State Grid Hunan Electric Power Limited Company, China - Qian Liu 0029
— Beijing Electronic Science and Technology Institute, Beijing, China - Qian Liu 0030
— Harbin Medical University, Harbin, China - Qian Liu 0031
— Tianjin University of Technology, Tianjin, China - Qian Liu 0032
— Jinan University, Guangzhou, Guangdong, China - Qian Liu 0033 — ByteDance, TikTok AI Innovation Center, Singapore (and 2 more)
- Qian Liu 0034 — Xihua University, School of Computer and Software Engineering, Chengdu, China
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j19]Shuxian Niu
, Qian Liu
, Yang Zhou
, Min Li
:
Fast algorithms combining threshold-decreasing and greedy methods for maximizing constraint k-submodular functions. Discret. Math. Algorithms Appl. 17(4): 2450061:1-2450061:13 (2025)
[j18]Ao Zhao, Yang Zhou, Qian Liu:
Improved Approximation Algorithms for Matroid and Knapsack Means Problems. Int. J. Found. Comput. Sci. 36(5): 709-729 (2025)
[j17]Yuying Li, Min Li, Yang Zhou, Shuxian Niu, Qian Liu
:
Randomized approximation algorithms for monotone k-submodular function maximization with constraints. J. Comb. Optim. 49(4): 64 (2025)
[j16]Hanlu Ye, Min Li, Yang Zhou, Qian Liu:
Maximizing a $ k $-submodular function with $ p $-system constraints. Math. Found. Comput. 8(3): 448-459 (2025)- 2024
[c11]Haifeng Huang, Qian Liu, Yang Zhou, Min Li:
or-Submodular Maximization Under a Matroid Constraint and a Knapsack Constraint. AAIM (1) 2024: 145-156- 2023
[j15]Ao Zhao, Qian Liu, Yang Zhou
, Min Li:
Approximation Algorithms for Matroid and Knapsack Means Problems. Asia Pac. J. Oper. Res. 40(1): 2240007:1-2240007:16 (2023)
[j14]Kemin Yu, Min Li, Yang Zhou, Qian Liu
:
On maximizing monotone or non-monotone k-submodular functions with the intersection of knapsack and matroid constraints. J. Comb. Optim. 45(3): 93 (2023)
[c10]Yanfei Li, Min Li, Qian Liu, Yang Zhou:
DR-Submodular Function Maximization with Adaptive Stepsize. COCOON (1) 2023: 347-358
[c9]YuYing Li, Min Li, Yang Zhou, Qian Liu:
Random Approximation Algorithms for Monotone k-Submodular Function Maximization with Size Constraints. IJTCS-FAW 2023: 116-128- 2022
[j13]Xiaojuan Zhang, Qian Liu, Min Li, Yang Zhou
:
Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy. J. Comb. Optim. 44(5): 3549-3574 (2022)
[j12]Xiaojian Yang, Qian Liu, Xiyu Liu
, Jie Xue
:
An improved deep echo state network inspired by tissue-like P system forecasting for non-stationary time series. J. Membr. Comput. 4(3): 222-231 (2022)
[j11]Qian Liu, Hua Ji
, Gang Liu:
Generative image inpainting using edge prediction and appearance flow. Multim. Tools Appl. 81(22): 31709-31725 (2022)
[j10]Min Li, Hao Xiao, Qian Liu, Yang Zhou
:
The submodularity of two-stage stochastic maximum-weight independent set problems. Theor. Comput. Sci. 937: 50-62 (2022)
[c8]Kemin Yu, Min Li, Yang Zhou, Qian Liu:
Guarantees for Maximization of k-Submodular Functions with a Knapsack and a Matroid Constraint. AAIM 2022: 156-167
[c7]Hao Xiao, Qian Liu, Yang Zhou, Min Li:
Non-monotone k-Submodular Function Maximization with Individual Size Constraints. CSoNet 2022: 268-279- 2021
[j9]Qian Liu
, Jianxin Liu, Min Li, Yang Zhou
:
Approximation algorithms for fuzzy C-means problem based on seeding method. Theor. Comput. Sci. 885: 146-158 (2021)
[c6]Xiaojuan Zhang, Qian Liu, Min Li, Yang Zhou
:
Bi-criteria Adaptive Algorithms for Minimizing Supermodular Functions with Cardinality Constraint. AAIM 2021: 179-189
[c5]Min Li, Qian Liu, Yang Zhou
:
Two-Stage Stochastic Max-Weight Independent Set Problems. COCOA 2021: 203-213
[c4]Qian Liu, Xiyu Liu:
An Improved CF Tree Clustering Based on Tissue-Like P System. ICIC (2) 2021: 368-381- 2020
[j8]Qian Liu, Yuqing Xu, Yang Zhou
:
A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems. J. Glob. Optim. 76(4): 745-768 (2020)
[j7]Jiachen Ju, Qian Liu
:
Convergence properties of a class of exact penalty methods for semi-infinite optimization problems. Math. Methods Oper. Res. 91(3): 383-403 (2020)
[c3]Yang Zhou
, Jianxin Liu, Min Li, Qian Liu:
A Bi-criteria Analysis for Fuzzy C-means Problem. AAIM 2020: 149-160
[c2]Jiachen Ju, Min Li, Jianxin Liu, Qian Liu, Yang Zhou
:
Nonsubmodular Maximization with Knapsack Constraint via Multilinear Extension. PAAP 2020: 81-92
[c1]Qian Liu, Jianxin Liu, Min Li, Yang Zhou
:
A Novel Initialization Algorithm for Fuzzy C-means Problem. TAMC 2020: 215-225
2010 – 2019
- 2017
[j6]Changyu Wang, Qian Liu, Biao Qu:
Global saddle points of nonlinear augmented Lagrangian functions. J. Glob. Optim. 68(1): 125-146 (2017)- 2013
[j5]Changyu Wang, Qian Liu, Cheng Ma:
Smoothing SQP algorithm for semismooth equations with box constraints. Comput. Optim. Appl. 55(2): 399-425 (2013)
[j4]Qian Liu, Changyu Wang, Xinmin Yang:
On the convergence of a smoothed penalty algorithm for semi-infinite programming. Math. Methods Oper. Res. 78(2): 203-220 (2013)- 2012
[j3]Qian Liu, Changyu Wang:
An Augmented Lagrangian Algorithm for Solving Semiinfinite Programming. J. Appl. Math. 2012: 145083:1-145083:11 (2012)
2000 – 2009
- 2009
[j2]Qian Liu, Wan Mei Tang, Xinmin Yang:
Properties of saddle points for generalized augmented Lagrangian. Math. Methods Oper. Res. 69(1): 111-124 (2009)- 2006
[j1]Qian Liu, Changyu Wang, Xinmin Yang:
On the Convergence of a New Hybrid Projection Algorithm. J. Syst. Sci. Complex. 19(3): 423-430 (2006)
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 2026-01-30 23:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID







