Wenda Zhang

According to our database, Wenda Zhang authored at least 4 papers between 2021 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Results for the close-enough traveling salesman problem with a branch-and-bound algorithm.

Wenda Zhang, Jason J. Sauppe, Sheldon H. Jacobson

Comput. Optim. Appl., June, 2023

2021

An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints.

Wenda Zhang, Jason J. Sauppe, Sheldon H. Jacobson

INFORMS J. Comput., 2021

High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system.

Amir Hossein Gharehgozli, Chao Xu, Wenda Zhang

Eur. J. Oper. Res., 2021

Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search.

Wenda Zhang, Jason J. Sauppe, Sheldon H. Jacobson

Comput. Oper. Res., 2021