Wei Wu

Orcid: 0000-0002-0443-3642

Affiliations:
  • Seikei University, Tokyo, Japan
  • Nagoya University, Japan (former)


According to our database1, Wei Wu authored at least 9 papers between 2014 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
Packing squares independently.
Theor. Comput. Sci., 2025

2024
Heuristic algorithms based on column generation for an online product shipping problem.
Comput. Oper. Res., January, 2024

Robust scheduling for minimizing maximum lateness on a serial-batch processing machine.
Inf. Process. Lett., 2024

2023
Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems.
Eur. J. Oper. Res., May, 2023

Packing squares independently.
CoRR, 2023

2022
An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion.
INFORMS J. Comput., 2022

2018
Exact and heuristic algorithms for the interval min-max regret generalized assignment problem.
Comput. Ind. Eng., 2018

Generalized Assignment Problem.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2014
Algorithms for the min-max regret generalized assignment problem with interval data.
Proceedings of the 2014 IEEE International Conference on Industrial Engineering and Engineering Management, 2014


  Loading...