Du D.Z.

D.Z. Du

Information about the author D.Z. Du will soon be added to the site.
Found 4 papers in total
Approximations for a bottleneck Steiner tree problem
Approximations for a bottleneck Steiner tree problem
2002
In the design of wireless communication networks, due to a budget limit, suppose we...
Quadratic integer programming with application to the chaotic mappings of complete multipartite graphs
Quadratic integer programming with application to the chaotic mappings of complete multipartite graphs
2001
In this paper, we study the chaotic mappings of complete multipartite graphs. The...
An O(n log n) average time algorithm for computing the shortest network under a given topology
An O(n log n) average time algorithm for computing the shortest network under a given topology
1999
In 1992 F.K. Hwang and J.F. Weng published an O(n 2 ) time algorithm for computing the...
On Rosen’s gradient projection methods
On Rosen’s gradient projection methods
1990
This paper is a survey of Rosen’s projection methods in nonlinear programming....
Papers per page: