Algorithms for the min-max regret generalized assignment problem with interval data. - Wei Wu 017; Manuel Iori; Silvano Martello; Mutsunori Yagiura (IEEM, 2014)

Generalized Assignment Problem. - Wei Wu 017; Mutsunori Yagiura; Toshihide Ibaraki (Handbook of Approximation Algorithms and Metaheuristics (1), 2018)

Exact and heuristic algorithms for the interval min-max regret generalized assignment problem. - Wei Wu 017; Manuel Iori; Silvano Martello; Mutsunori Yagiura (Comput. Ind. Eng., 2018)

An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion. - Wei Wu 017; Manuel Iori; Silvano Martello; Mutsunori Yagiura (INFORMS J. Comput., 2022)

Packing squares independently. - Wei Wu 017; Hiroki Numaguchi; Yannan Hu; Mutsunori Yagiura (CoRR, 2023)

Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems. - Wei Wu 017; Takito Hayashi; Kato Haruyasu; Liang Tang (Eur. J. Oper. Res., 2023)

Robust scheduling for minimizing maximum lateness on a serial-batch processing machine. - Wei Wu 017; Liang Tang; Andrea Pizzuti (Inf. Process. Lett., 2024)

Heuristic algorithms based on column generation for an online product shipping problem. - Wei Wu 017; Mayu Ito; Yannan Hu; Hiromichi Goko; Mihiro Sasaki; Mutsunori Yagiura (Comput. Oper. Res., 2024)

New Heuristic Approaches for the Min-Max Regret Traveling Salesman Problem. - Kazuki Hasegawa; Wei Wu 017; Mutsunori Yagiura (IEEE Access, 2025)

One-dimensional bin packing with pattern-dependent processing time. - Fabrizio Marinelli 001; Andrea Pizzuti; Wei Wu 017; Mutsunori Yagiura (Eur. J. Oper. Res., 2025)

Packing squares independently. - Wei Wu 017; Hiroki Numaguchi; Nir Halman; Yannan Hu; Mutsunori Yagiura (Theor. Comput. Sci., 2025)