Ting Wu

Orcid: 0000-0002-2644-4203

Affiliations:
  • Nanjing University, Department of Mathematics, Nanjing, China


According to our database1, Ting Wu authored at least 15 papers between 2006 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
A class of accelerated GADMM-based method for multi-block nonconvex optimization problems.
Numer. Algorithms, February, 2025

Location-routing optimization problem of pharmaceutical cold chain logistics with oil-electric mixed fleets under uncertainties.
Comput. Ind. Eng., 2025

2023
An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance.
Optim. Lett., March, 2023

An inertial proximal partially symmetric ADMM-based algorithm for linearly constrained multi-block nonconvex optimization problems with applications.
J. Comput. Appl. Math., 2023

2021
Bi-objective traffic count location model for mean and covariance of origin-destination estimation.
Expert Syst. Appl., 2021

2019
Spatial and Temporal Analyses for Estimation of Origin-Destination Demands by Time of Day Over Year.
IEEE Access, 2019

A Reliable Deployment Strategy for Public Electric Vehicle Charging Stations: A Discrete Event Simulation Model for Power Grid and Traffic Networks.
Proceedings of the 2019 Winter Simulation Conference, 2019

2014
Production planning and pricing policy in a make-to-stock system with uncertain demand subject to machine breakdowns.
Eur. J. Oper. Res., 2014

A computational study for common network design in multi-commodity supply chains.
Comput. Oper. Res., 2014

2012
A Bi-dimensional Search-based Algorithm for Unconstrained Optimization Problems.
Proceedings of the Fifth International Joint Conference on Computational Sciences and Optimization, 2012

2011
A Class of Linearized Proximal Alternating Direction Methods.
J. Optim. Theory Appl., 2011

2009
A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization.
Comput. Math. Appl., 2009

2008
A new quasi-Newton pattern search method based on symmetric rank-one update for unconstrained optimization.
Comput. Math. Appl., 2008

Solving unconstrained optimization problem with a filter-based nonmonotone pattern search algorithm.
Appl. Math. Comput., 2008

2006
A quasi-Newton based pattern search algorithm for unconstrained optimization.
Appl. Math. Comput., 2006


  Loading...