# Jianzhong Zhang

According to our database

Collaborative distances:

^{1}, Jianzhong Zhang authored at least 50 papers between 1994 and 2010.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2010

Inverse optimization for linearly constrained convex separable programming problems.

European Journal of Operational Research, 2010

Some projection-like methods for the generalized Nash equilibria.

Comp. Opt. and Appl., 2010

2009

Numerical Methods for Unary Optimization.

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

2008

An inverse model for the most uniform problem.

Oper. Res. Lett., 2008

The partial inverse minimum spanning tree problem when weight increase is forbidden.

European Journal of Operational Research, 2008

The inverse 1-median problem on a cycle.

Discrete Optimization, 2008

2007

Partial inverse assignment problems under l

_{1}norm.
Oper. Res. Lett., 2007

On the optimum capacity of capacity expansion problems.

Math. Meth. of OR, 2007

Some inverse min-max network problems under weighted

*l*_{1}and*l*_{infinity}norms with bound constraints on changes.
J. Comb. Optim., 2007

Improving multicut in directed trees by upgrading nodes.

European Journal of Operational Research, 2007

Inverse constrained bottleneck problems under weighted l

_{infinity}norm.
Computers & OR, 2007

Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems.

Comp. Opt. and Appl., 2007

2006

Constrained Inverse Minimum Spanning Tree Problems under the Bottleneck-Type Hamming Distance.

J. Global Optimization, 2006

The shortest path improvement problems under Hamming distance.

J. Comb. Optim., 2006

Inverse maximum flow problems under the weighted Hamming distance.

J. Comb. Optim., 2006

A class of node based bottleneck improvement problems.

European Journal of Operational Research, 2006

A Modified Quasi-Newton Method for Structured Optimization with Partial Information on the Hessian.

Comp. Opt. and Appl., 2006

Inverse Bottleneck Optimization Problems on Networks.

Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005

An Inexact Newton Method Derived from Efficiency Analysis.

J. Global Optimization, 2005

The Center Location Improvement Problem Under the Hamming Distance.

J. Comb. Optim., 2005

Inverse Constrained Bottleneck Problems on Networks.

Proceedings of the Computational Science and Its Applications, 2005

Some New Results on Inverse Sorting Problems.

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints.

Numerische Mathematik, 2004

Inapproximability and a polynomially solvable special case of a network improvement problem.

European Journal of Operational Research, 2004

Weight reduction problems with certain bottleneck objectives.

European Journal of Operational Research, 2004

Inverse median problems.

Discrete Optimization, 2004

A Network Improvement Problem Under Different Norms.

Comp. Opt. and Appl., 2004

2003

Identification of the Optimal Active Set in a Noninterior Continuation Method for LCP.

J. Global Optimization, 2003

Computation of the Reverse Shortest-Path Problem.

J. Global Optimization, 2003

On Inverse Problems of Optimum Perfect Matching.

J. Comb. Optim., 2003

2002

An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems.

Optimization Methods and Software, 2002

New projection-type methods for monotone LCP with finite termination.

Numerische Mathematik, 2002

A General Model of Some Inverse Combinatorial Optimization Problems and Its Solution Method Under l-Norm.

J. Comb. Optim., 2002

PCG-inexact Newton methods for unary optimization.

European Journal of Operational Research, 2002

A characteristic quantity of P-matrices.

Appl. Math. Lett., 2002

2001

Bottleneck Capacity Expansion Problems with General Budget Constraints.

RAIRO - Operations Research, 2001

A class of bottleneck expansion problems.

Computers & OR, 2001

A Survey of Quasi-Newton Equations and Quasi-Newton Methods for Optimization.

Annals OR, 2001

2000

A Family of Scaled Factorized Broyden-Like Methods for Nonlinear Least Squares Problems.

SIAM Journal on Optimization, 2000

Global

*s*-type error bound for the extended linear complementarity problem and applications.
Math. Program., 2000

Some reverse location problems.

European Journal of Operational Research, 2000

1999

A Class of Indefinite Dogleg Path Methods for Unconstrained Minimization.

SIAM Journal on Optimization, 1999

The Complexity Analysis of the Inverse Center Location Problem.

J. Global Optimization, 1999

Solution Structure of Some Inverse Combinatorial Optimization Problems.

J. Comb. Optim., 1999

Trust region dogleg path algorithms for unconstrained minimization.

Annals OR, 1999

Reverse Center Location Problem.

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

1998

Inverse problem of minimum cuts.

Math. Meth. of OR, 1998

1996

On the inverse problem of minimum spanning tree with partition constraints.

Math. Meth. of OR, 1996

1995

A column generation method for inverse shortest path problems.

Math. Meth. of OR, 1995

1994

A priority measure in interval methods for constrained global optimization.

Computers & OR, 1994