A priority measure in interval methods for constrained global optimization. - Jianzhong Zhang 001; Dan Sha (Comput. Oper. Res., 1994)

A column generation method for inverse shortest path problems. - Jianzhong Zhang 001; Zhongfan Ma; Chao Yang (Math. Methods Oper. Res., 1995)

On the inverse problem of minimum spanning tree with partition constraints. - Jianzhong Zhang 001; Zhenhong Liu; Zhongfan Ma (Math. Methods Oper. Res., 1996)

Inverse problem of minimum cuts. - Jianzhong Zhang 001; Mao-cheng Cai (Math. Methods Oper. Res., 1998)

Reverse Center Location Problem. - Jianzhong Zhang 001; Xiaoguang Yang; Mao-cheng Cai (ISAAC, 1999)

Trust region dogleg path algorithms for unconstrained minimization. - Jianzhong Zhang 001; Chengxian Xu (Ann. Oper. Res., 1999)

Solution Structure of Some Inverse Combinatorial Optimization Problems. - Jianzhong Zhang 001; Zhongfan Ma (J. Comb. Optim., 1999)

The Complexity Analysis of the Inverse Center Location Problem. - Mao-cheng Cai; Xiaoguang Yang; Jianzhong Zhang 001 (J. Glob. Optim., 1999)

A Class of Indefinite Dogleg Path Methods for Unconstrained Minimization. - Jianzhong Zhang 001; Chengxian Xu (SIAM J. Optim., 1999)

Some reverse location problems. - Jianzhong Zhang 001; Zhenhong Liu; Zhongfan Ma (Eur. J. Oper. Res., 2000)

Global s -type error bound for the extended linear complementarity problem and applications. - Jianzhong Zhang 001; Naihua Xiu (Math. Program., 2000)

A Family of Scaled Factorized Broyden-Like Methods for Nonlinear Least Squares Problems. - Jianzhong Zhang 001; L. H. Chen; Naiyang Deng (SIAM J. Optim., 2000)

A Survey of Quasi-Newton Equations and Quasi-Newton Methods for Optimization. - Chengxian Xu; Jianzhong Zhang 001 (Ann. Oper. Res., 2001)

A class of bottleneck expansion problems. - Jianzhong Zhang 001; Chao Yang; Yixun Lin (Comput. Oper. Res., 2001)

Bottleneck Capacity Expansion Problems with General Budget Constraints. - Rainer E. Burkard; Bettina Klinz; Jianzhong Zhang 001 (RAIRO Oper. Res., 2001)

A characteristic quantity of P-matrices. - Naihua Xiu; Jianzhong Zhang 001 (Appl. Math. Lett., 2002)

PCG-inexact Newton methods for unary optimization. - Jianzhong Zhang 001; Yi Xue; Ping Zhong; Naiyang Deng (Eur. J. Oper. Res., 2002)

A General Model of Some Inverse Combinatorial Optimization Problems and Its Solution Method Under l-Norm. - Jianzhong Zhang 001; Zhenhong Liu (J. Comb. Optim., 2002)

New projection-type methods for monotone LCP with finite termination. - Jianzhong Zhang 001; Naihua Xiu (Numerische Mathematik, 2002)

An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems. - Jianzhong Zhang 001; Zhenhong Liu (Optim. Methods Softw., 2002)

On Inverse Problems of Optimum Perfect Matching. - Zhenhong Liu; Jianzhong Zhang 001 (J. Comb. Optim., 2003)

Computation of the Reverse Shortest-Path Problem. - Jianzhong Zhang 001; Yixun Lin (J. Glob. Optim., 2003)

Identification of the Optimal Active Set in a Noninterior Continuation Method for LCP. - Naihua Xiu; Jianzhong Zhang 001 (J. Glob. Optim., 2003)

A Network Improvement Problem Under Different Norms. - Jianzhong Zhang 001; Xiaoguang Yang; Mao-cheng Cai (Comput. Optim. Appl., 2004)

Inverse median problems. - Rainer E. Burkard; Carmen Pleschiutschnig; Jianzhong Zhang 001 (Discret. Optim., 2004)

Weight reduction problems with certain bottleneck objectives. - Rainer E. Burkard; Yixun Lin; Jianzhong Zhang 001 (Eur. J. Oper. Res., 2004)

Inapproximability and a polynomially solvable special case of a network improvement problem. - Jianzhong Zhang 001; Xiaoguang Yang; Mao-cheng Cai (Eur. J. Oper. Res., 2004)

A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints. - Jianzhong Zhang 001; G. S. Liu; S. Y. Wang (Numerische Mathematik, 2004)

Some New Results on Inverse Sorting Problems. - Xiaoguang Yang; Jianzhong Zhang 001 (COCOON, 2005)

Inverse Constrained Bottleneck Problems on Networks. - Xiucui Guan; Jianzhong Zhang 001 (ICCSA (4), 2005)

The Center Location Improvement Problem Under the Hamming Distance. - Binwu Zhang; Jianzhong Zhang 001; Yong He (J. Comb. Optim., 2005)

An Inexact Newton Method Derived from Efficiency Analysis. - Naiyang Deng; Yi Xue; Jianzhong Zhang 001; Ping Zhong (J. Glob. Optim., 2005)

Inverse Bottleneck Optimization Problems on Networks. - Xiucui Guan; Jianzhong Zhang 001 (AAIM, 2006)

A Modified Quasi-Newton Method for Structured Optimization with Partial Information on the Hessian. - L. H. Chen; Naiyang Deng; Jianzhong Zhang 001 (Comput. Optim. Appl., 2006)

A class of node based bottleneck improvement problems. - Xiucui Guan; Jianzhong Zhang 001 (Eur. J. Oper. Res., 2006)

Inverse maximum flow problems under the weighted Hamming distance. - Longcheng Liu; Jianzhong Zhang 001 (J. Comb. Optim., 2006)

The shortest path improvement problems under Hamming distance. - Binwu Zhang; Jianzhong Zhang 001; Liqun Qi 001 (J. Comb. Optim., 2006)

Constrained Inverse Minimum Spanning Tree Problems under the Bottleneck-Type Hamming Distance. - Binwu Zhang; Jianzhong Zhang 001; Yong He (J. Glob. Optim., 2006)

Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems. - Xiaoguang Yang; Jianzhong Zhang 001 (Comput. Optim. Appl., 2007)

Inverse constrained bottleneck problems under weighted linfinity norm. - Xiucui Guan; Jianzhong Zhang 001 (Comput. Oper. Res., 2007)

Improving multicut in directed trees by upgrading nodes. - Xiucui Guan; Jianzhong Zhang 001 (Eur. J. Oper. Res., 2007)

Some inverse min-max network problems under weighted l1 and linfinity norms with bound constraints on changes. - Xiaoguang Yang; Jianzhong Zhang 001 (J. Comb. Optim., 2007)

On the optimum capacity of capacity expansion problems. - Chao Yang; Chunyan Hao; Jianzhong Zhang 001 (Math. Methods Oper. Res., 2007)

Partial inverse assignment problems under l1 norm. - Xiaoguang Yang; Jianzhong Zhang 001 (Oper. Res. Lett., 2007)

The inverse 1-median problem on a cycle. - Rainer E. Burkard; Carmen Pleschiutschnig; Jianzhong Zhang 001 (Discret. Optim., 2008)

The partial inverse minimum spanning tree problem when weight increase is forbidden. - Mao-cheng Cai; C. W. Duin; Xiaoguang Yang; Jianzhong Zhang 001 (Eur. J. Oper. Res., 2008)

An inverse model for the most uniform problem. - Qin Wang 001; Jinjiang Yuan; Jianzhong Zhang 001 (Oper. Res. Lett., 2008)

Numerical Methods for Unary Optimization. - Emilio Spedicato; Naiyang Deng; Jianzhong Zhang 001; Shaolin Xi (Encyclopedia of Optimization, 2009)

Some projection-like methods for the generalized Nash equilibria. - Jianzhong Zhang 001; Biao Qu; Naihua Xiu (Comput. Optim. Appl., 2010)

Inverse optimization for linearly constrained convex separable programming problems. - Jianzhong Zhang 001; Chengxian Xu (Eur. J. Oper. Res., 2010)