default search action
Zhiqing Meng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j24]Aihua Zhu, Zhiqing Meng
, Rui Shen
Research on Fuzzy Temporal Event Association Mining Model and Algorithm. Axioms 12(2): 117 (2023) - [j23]Guangsheng Zhang
Operation decision of logistics service supply chain: considering interruption probability in emergencies. Kybernetes 52(1): 284-303 (2023) - 2021
- [j22]Min Jiang, Zhiqing Meng
Partial Exactness for the Penalty Function of Biconvex Programming. Entropy 23(2): 132 (2021) - [j21]Min Jiang, Zhiqing Meng, Gengui Zhou, Rui Shen:
On the smoothing of the norm objective penalty function for two-cardinality sparse constrained optimization problems. Neurocomputing 458: 559-565 (2021) - [j20]Zhiqing Meng
An objective penalty function method for biconvex programming. J. Glob. Optim. 81(3): 599-620 (2021) - 2020
- [j19]Rui Shen, Zhiqing Meng, Min Jiang:
Smoothing Partially Exact Penalty Function of Biconvex Programming. Asia Pac. J. Oper. Res. 37(4): 2040018:1-2040018:27 (2020)
2010 – 2019
- 2019
- [j18]Leiyan Xu, Zhiqing Meng:
Multi-Loss WCVaR Risk Decision Optimization Based On Weight for Centralized Supply Problem of Direct Chain Enterprises. Asia Pac. J. Oper. Res. 36(2): 1940007:1-1940007:16 (2019) - [j17]Min Jiang, Zhiqing Meng, Rui Shen:
压缩感知问题的目标罚函数交替随机搜索方法 (Alternate Random Search Algorithm of Objective Penalty Function for Compressed Sensing Problem). 计算机科学 46(6A): 133-137 (2019) - [j16]Zhiqing Meng, Weiwei Xu:
时态文本数据流特征流行趋势模型及算法 (Temporal Text Data Stream Feature Trend Model and Algorithm). 计算机科学 46(6A): 417-422 (2019) - 2018
- [c20]Min Jiang, Zhiqing Meng, Gengui Zhou, Rui Shen:
A Smoothing Penalty Function Algorithm for Two-Cardinality Sparse Constrained Optimization Problems. CIS 2018: 45-49 - 2017
- [j15]Zhiqing Meng, Leiyan Xu, Min Jiang, Rui Shen:
压缩感知优化问题的等价表示及其目标罚函数方法 (Equivalent Representation of Compressed Sensing Optimization Problem and Its Penalty Function Method). 计算机科学 44(Z6): 97-98 (2017) - 2016
- [j14]Ying Zheng, Zhiqing Meng, Rui Shen:
An M-Objective Penalty Function Algorithm Under Big Penalty Parameters. J. Syst. Sci. Complex. 29(2): 455-471 (2016) - [j13]Zhiqing Meng, Ke Ma, Ying Zheng:
基于核函数技术的时尚服装需求预测方法 (Forecasting Method for Fashion Clothing Demand Based on Kernel Functions Technology). 计算机科学 43(Z11): 455-460 (2016) - 2015
- [j12]Xinsheng Xu, Zhiqing Meng, Rui Shen:
A cooperation model based on CVaR measure for a two-stage supply chain. Int. J. Syst. Sci. 46(10): 1865-1873 (2015) - 2014
- [j11]Min Jiang, Zhiqing Meng, Rui Shen, Xinsheng Xu:
A quadratic objective penalty function for bilevel programming. J. Syst. Sci. Complex. 27(2): 327-337 (2014) - 2013
- [j10]Xinsheng Xu, Zhiqing Meng, Rui Shen:
A tri-level programming model based on Conditional Value-at-Risk for three-stage supply chain management. Comput. Ind. Eng. 66(2): 470-475 (2013) - [j9]Xinsheng Xu, Zhiqing Meng, Jianwu Sun, LiGuo Huang
A second-order smooth penalty function algorithm for constrained optimization problems. Comput. Optim. Appl. 55(1): 155-172 (2013) - [j8]Zhiqing Meng, Chuangyin Dang
Exactness and algorithm of an objective penalty function. J. Glob. Optim. 56(2): 691-711 (2013) - 2012
- [j7]Zhiqing Meng, Chuangyin Dang
An Objective Penalty Function of Bilevel Programming. J. Optim. Theory Appl. 153(2): 377-387 (2012) - 2011
- [j6]Xinsheng Xu, Zhiqing Meng, Jianwu Sun, Rui Shen:
A penalty function method based on smoothing lower order penalty function. J. Comput. Appl. Math. 235(14): 4047-4058 (2011) - [j5]Zhiqing Meng, Min Jiang, Qiying Hu:
Dynamic CVaR with multi-period risk problems. J. Syst. Sci. Complex. 24(5): 907-918 (2011) - [c19]Min Jiang, Zhiqing Meng, Xinsheng Xu, Rui Shen, Gengui Zhou:
Multiobjective Interaction Programming for Two-Persons. CIS 2011: 1515-1519 - 2010
- [c18]Zhiqing Meng, Baosheng Shao, Min Jiang:
An Algorithm of Dynamic Associate Rule Based on Sliding Windows. CIS 2010: 51-54 - [c17]Zhiqing Meng, Min Jiang, Chuangyin Dang
Evolutionary Algorithm for Zero-One Constrained Optimization Problems Based on Objective Penalty Function. CIS 2010: 132-136
2000 – 2009
- 2009
- [j4]Gengui Zhou, Zhenyu Cao, Zhiqing Meng, Jian Cao:
Ga-Based Alternative Approaches for the Degree-Constrained Spanning Tree Problem. Int. J. Pattern Recognit. Artif. Intell. 23(1): 129-144 (2009) - [c16]Min Jiang, Zhiqing Meng, Gengui Zhou:
A New Support Vector Machine Model Based on the Discrete Conditional Value-at-Risk. CIS (1) 2009: 188-192 - 2008
- [c15]Gengui Zhou, Zhenyu Cao, Zhiqing Meng, Qi Xu:
A GA-Based Approach on a Repair Logistics Network Design with M/M/s Model. CIS (1) 2008: 145-149 - 2007
- [j3]Xiaoqi Yang
Lagrange Multipliers and Calmness Conditions of Order p. Math. Oper. Res. 32(1): 95-101 (2007) - [c14]Min Jiang, Zhiqing Meng, Gengui Zhou:
A Smoothing Support Vector Machine Based on Quarter Penalty Function. CIS 2007: 57-59 - [c13]Gengui Zhou, Zhiqing Meng, Zhenyu Cao, Jian Cao:
A New Tree Encoding for the Degree-Constrained Spanning Tree Problem. CIS 2007: 85-90 - [c12]Zhiqing Meng, Hua Jiang, Min Jiang, Yubao Liu:
An Algorithm of Discovering Approximate Periodicity Based on Self-Organizing Map for Temporal Data. FSKD (3) 2007: 293-297 - 2006
- [j2]Zhiqing Meng, Chuangyin Dang
On the Smoothing of the Square-Root Exact Penalty Function for Inequality Constrained Optimization. Comput. Optim. Appl. 35(3): 375-398 (2006) - [c11]Gengui Zhou, Zhenyu Cao, Jian Cao, Zhiqing Meng:
A Centralized Network Design Problem with Genetic Algorithm Approach. CIS 2006: 123-132 - [c10]Zhiqing Meng, Lifang Peng, Gengui Zhou, Yihua Zhu:
A Multi-classification Method of Temporal Data Based on Support Vector Machine. CIS 2006: 240-249 - [c9]Zhiqing Meng, Gengui Zhou, Yihua Zhu:
A Hopfiled Neural Network Based on Penalty Function with Objective Parameters. ICNC (1) 2006: 123-126 - [c8]Huihong Jin, Zhiqing Meng, Xuanxi Ning:
A Smoothing Multiple Support Vector Machine Model. ISNN (1) 2006: 942-948 - 2005
- [c7]Gengui Zhou, Zhenyu Cao, Jian Cao, Zhiqing Meng:
A Genetic Algorithm Approach on Reverse Logistics Optimization for Product Return Distribution Network. CIS (1) 2005: 267-272 - [c6]Zhiqing Meng, Gengui Zhou, Yihua Zhu, Lifang Peng:
A Smoothing Support Vector Machine Based on Exact Penalty Function. CIS (1) 2005: 568-573 - [c5]Zhiqing Meng, Hongcan Zhu, Yihua Zhu, Gengui Zhou:
A Clustering Algorithm for Chinese Text Based on SOM Neural Network and Density. ISNN (2) 2005: 251-256 - [c4]Zhiqing Meng, Chuangyin Dang:
A Hopfiled Neural Network for Nonlinear Constrained Optimization Problems Based on Penalty Function. ISNN (1) 2005: 712-717 - 2004
- [j1]Zhiqing Meng, Qiying Hu, Chuangyin Dang
An objective penalty function method for nonlinear programming. Appl. Math. Lett. 17(6): 683-689 (2004) - [c3]Min Jiang, Qiying Hu, Zhiqing Meng:
A Method on Solving Multiobjective Conditional Value-at-Risk. International Conference on Computational Science 2004: 923-930 - [c2]Zhiqing Meng, Chuangyin Dang, Gengui Zhou, Yihua Zhu, Min Jiang:
A New Neural Network for Nonlinear Constrained Optimization Problems. ISNN (1) 2004: 406-412 - [c1]Min Jiang, Zhiqing Meng, Qiying Hu:
A Neural Network Model on Solving Multiobjective Conditional Value-at-Risk. ISNN (2) 2004: 1000-1006
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-05-13 21:15 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: