Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJianzhong Zhang 0001
Person information
- affiliation: City University of Hong Kong, Department of Mathematics
- affiliation: Chinese University of Hong Kong, Department of System Engineering and Engineering Management
Other persons with the same name
- Jianzhong Zhang — disambiguation page
- Jianzhong Zhang 0002
![[0000-0001-9775-2783]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-9775-2783")
(aka: Jianzhong (Charlie) Zhang, Jianzhong Charlie Zhang, Charlie Jianzhong Zhang, Charlie Zhang 0002) — Samsung Research America, Plano, TX, USA (and 2 more) - Jianzhong Zhang 0003 — Nankai University, Tianjin, College of Computer and Control Engineering
- Jianzhong Zhang 0004 — Iowa State University
- Jianzhong Zhang 0005 (aka: Jian-Zhong Zhang 0005) — Shaanxi Normal University, School of Mathematics and Statistics, China
- Jianzhong Zhang 0006 — Southeast University, Nanjing
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j45]Jianzhong Zhang, Biao Qu, Naihua Xiu:
Some projection-like methods for the generalized Nash equilibria. Comput. Optim. Appl. 45(1): 89-109 (2010)- [j44]Jianzhong Zhang, Chengxian Xu:
Inverse optimization for linearly constrained convex separable programming problems. Eur. J. Oper. Res. 200(3): 671-679 (2010)
2000 – 2009
- 2009
- [r1]Emilio Spedicato, Naiyang Deng, Jianzhong Zhang, Shaolin Xi:
Numerical Methods for Unary Optimization. Encyclopedia of Optimization 2009: 2682-2689 - 2008
- [j43]Rainer E. Burkard, Carmen Pleschiutschnig, Jianzhong Zhang:
The inverse 1-median problem on a cycle. Discret. Optim. 5(2): 242-253 (2008) - [j42]Mao-cheng Cai, C. W. Duin, Xiaoguang Yang, Jianzhong Zhang:
The partial inverse minimum spanning tree problem when weight increase is forbidden. Eur. J. Oper. Res. 188(2): 348-353 (2008) - [j41]Qin Wang, Jinjiang Yuan, Jianzhong Zhang:
An inverse model for the most uniform problem. Oper. Res. Lett. 36(1): 26-30 (2008) - 2007
- [j40]Xiaoguang Yang, Jianzhong Zhang:
Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems. Comput. Optim. Appl. 36(1): 55-66 (2007) - [j39]Xiucui Guan, Jianzhong Zhang:
Inverse constrained bottleneck problems under weighted linfinity norm. Comput. Oper. Res. 34(11): 3243-3254 (2007) - [j38]Xiucui Guan, Jianzhong Zhang:
Improving multicut in directed trees by upgrading nodes. Eur. J. Oper. Res. 183(3): 971-980 (2007) - [j37]Xiaoguang Yang, Jianzhong Zhang:
Some inverse min-max network problems under weighted l1 and linfinity norms with bound constraints on changes. J. Comb. Optim. 13(2): 123-135 (2007) - [j36]Chao Yang, Chunyan Hao, Jianzhong Zhang:
On the optimum capacity of capacity expansion problems. Math. Methods Oper. Res. 66(2): 225-233 (2007) - [j35]Xiaoguang Yang, Jianzhong Zhang:
Partial inverse assignment problems under l1 norm. Oper. Res. Lett. 35(1): 23-28 (2007) - 2006
- [j34]L. H. Chen, Naiyang Deng, Jianzhong Zhang:
A Modified Quasi-Newton Method for Structured Optimization with Partial Information on the Hessian. Comput. Optim. Appl. 35(1): 5-18 (2006) - [j33]Xiucui Guan, Jianzhong Zhang:
A class of node based bottleneck improvement problems. Eur. J. Oper. Res. 174(3): 1540-1552 (2006) - [j32]Binwu Zhang, Jianzhong Zhang, Liqun Qi:
The shortest path improvement problems under Hamming distance. J. Comb. Optim. 12(4): 351-361 (2006) - [j31]Longcheng Liu, Jianzhong Zhang:
Inverse maximum flow problems under the weighted Hamming distance. J. Comb. Optim. 12(4): 395-408 (2006) - [j30]Binwu Zhang, Jianzhong Zhang, Yong He:
Constrained Inverse Minimum Spanning Tree Problems under the Bottleneck-Type Hamming Distance. J. Glob. Optim. 34(3): 467-474 (2006) - [c4]Xiucui Guan, Jianzhong Zhang:
Inverse Bottleneck Optimization Problems on Networks. AAIM 2006: 220-230 - 2005
- [j29]Binwu Zhang, Jianzhong Zhang, Yong He:
The Center Location Improvement Problem Under the Hamming Distance. J. Comb. Optim. 9(2): 187-198 (2005) - [j28]Naiyang Deng, Yi Xue, Jianzhong Zhang, Ping Zhong:
An Inexact Newton Method Derived from Efficiency Analysis. J. Glob. Optim. 31(2): 287-315 (2005) - [c3]Xiaoguang Yang, Jianzhong Zhang:
Some New Results on Inverse Sorting Problems. COCOON 2005: 985-992 - [c2]Xiucui Guan, Jianzhong Zhang:
Inverse Constrained Bottleneck Problems on Networks. ICCSA (4) 2005: 161-171 - 2004
- [j27]Jianzhong Zhang, Xiaoguang Yang, Mao-cheng Cai:
A Network Improvement Problem Under Different Norms. Comput. Optim. Appl. 27(3): 305-319 (2004) - [j26]Rainer E. Burkard, Carmen Pleschiutschnig, Jianzhong Zhang:
Inverse median problems. Discret. Optim. 1(1): 23-39 (2004) - [j25]Rainer E. Burkard, Yixun Lin, Jianzhong Zhang:
Weight reduction problems with certain bottleneck objectives. Eur. J. Oper. Res. 153(1): 191-199 (2004) - [j24]Jianzhong Zhang, Xiaoguang Yang, Mao-cheng Cai:
Inapproximability and a polynomially solvable special case of a network improvement problem. Eur. J. Oper. Res. 155(1): 251-257 (2004) - [j23]Jianzhong Zhang, G. S. Liu, S. Y. Wang:
A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints. Numerische Mathematik 98(3): 539-558 (2004) - 2003
- [j22]Zhenhong Liu, Jianzhong Zhang:
On Inverse Problems of Optimum Perfect Matching. J. Comb. Optim. 7(3): 215-228 (2003) - [j21]Jianzhong Zhang, Yixun Lin:
Computation of the Reverse Shortest-Path Problem. J. Glob. Optim. 25(3): 243-261 (2003) - [j20]Naihua Xiu, Jianzhong Zhang:
Identification of the Optimal Active Set in a Noninterior Continuation Method for LCP. J. Glob. Optim. 26(2): 183-198 (2003) - 2002
- [j19]Naihua Xiu, Jianzhong Zhang:
A characteristic quantity of P-matrices. Appl. Math. Lett. 15(1): 41-46 (2002) - [j18]Jianzhong Zhang, Yi Xue, Ping Zhong, Naiyang Deng:
PCG-inexact Newton methods for unary optimization. Eur. J. Oper. Res. 143(2): 419-431 (2002) - [j17]Jianzhong Zhang, Zhenhong Liu:
A General Model of Some Inverse Combinatorial Optimization Problems and Its Solution Method Under l-Norm. J. Comb. Optim. 6(2): 207-227 (2002) - [j16]Jianzhong Zhang, Naihua Xiu:
New projection-type methods for monotone LCP with finite termination. Numerische Mathematik 92(1): 179-195 (2002) - [j15]Jianzhong Zhang, Zhenhong Liu:
An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems. Optim. Methods Softw. 17(1): 61-75 (2002) - 2001
- [j14]Chengxian Xu, Jianzhong Zhang:
A Survey of Quasi-Newton Equations and Quasi-Newton Methods for Optimization. Ann. Oper. Res. 103(1-4): 213-234 (2001) - [j13]Jianzhong Zhang, Chao Yang, Yixun Lin:
A class of bottleneck expansion problems. Comput. Oper. Res. 28(6): 505-519 (2001) - [j12]Rainer E. Burkard, Bettina Klinz, Jianzhong Zhang:
Bottleneck Capacity Expansion Problems with General Budget Constraints. RAIRO Oper. Res. 35(1): 1-20 (2001) - 2000
- [j11]Jianzhong Zhang, Zhenhong Liu, Zhongfan Ma:
Some reverse location problems. Eur. J. Oper. Res. 124(1): 77-88 (2000) - [j10]Jianzhong Zhang, Naihua Xiu:
Global s -type error bound for the extended linear complementarity problem and applications. Math. Program. 88(2): 391-410 (2000) - [j9]Jianzhong Zhang, L. H. Chen, Naiyang Deng:
A Family of Scaled Factorized Broyden-Like Methods for Nonlinear Least Squares Problems. SIAM J. Optim. 10(4): 1163-1179 (2000)
1990 – 1999
- 1999
- [j8]Jianzhong Zhang, Chengxian Xu:
Trust region dogleg path algorithms for unconstrained minimization. Ann. Oper. Res. 87: 407-418 (1999) - [j7]Jianzhong Zhang, Zhongfan Ma:
Solution Structure of Some Inverse Combinatorial Optimization Problems. J. Comb. Optim. 3(1): 127-139 (1999) - [j6]Mao-cheng Cai, Xiaoguang Yang, Jianzhong Zhang:
The Complexity Analysis of the Inverse Center Location Problem. J. Glob. Optim. 15(2): 213-218 (1999) - [j5]Jianzhong Zhang, Chengxian Xu:
A Class of Indefinite Dogleg Path Methods for Unconstrained Minimization. SIAM J. Optim. 9(3): 646-667 (1999) - [c1]Jianzhong Zhang, Xiaoguang Yang, Mao-cheng Cai:
Reverse Center Location Problem. ISAAC 1999: 279-294 - 1998
- [j4]Jianzhong Zhang, Mao-cheng Cai:
Inverse problem of minimum cuts. Math. Methods Oper. Res. 47(1): 51-58 (1998) - 1996
- [j3]Jianzhong Zhang, Zhenhong Liu, Zhongfan Ma:
On the inverse problem of minimum spanning tree with partition constraints. Math. Methods Oper. Res. 44(2): 171-187 (1996) - 1995
- [j2]Jianzhong Zhang, Zhongfan Ma, Chao Yang:
A column generation method for inverse shortest path problems. Math. Methods Oper. Res. 41(3): 347-358 (1995) - 1994
- [j1]Jianzhong Zhang, Dan Sha:
A priority measure in interval methods for constrained global optimization. Comput. Oper. Res. 21(5): 511-519 (1994)
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-07-27 17:29 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:
