Research theme for competitive and other funds (5):
2021 - 2025 摂動レベルと後悔の度合いを考慮した組合せ最適化問題に対するロバスト最適化
2019 - 2022 Staff scheduling: Development of information-providing technologies for effective use of optimization algorithms in the field
2015 - 2019 Robust optimization based on mathematical programming approaches
2016 - 2018 組合せ問題に対するロバスト最適化
2012 - 2016 Mathematical programming approaches to robust optimization problems
Papers (30):
Fabrizio Marinelli, Andrea Pizzuti, Wei Wu, Mutsunori Yagiura. One-dimensional bin packing with pattern-dependent processing time. European Journal of Operational Research. 2025. 322. 3. 770-782
Kazuki Hasegawa, Wei Wu, Mutsunori Yagiura. New Heuristic Approaches for the Min-Max Regret Traveling Salesman Problem. IEEE Access. 2025. 13. 63952-63968
Wei Wu, Liang Tang, Andrea Pizzuti. Robust scheduling for minimizing maximum lateness on a serial-batch processing machine. Information Processing Letters. 2024. 186
An iterated dual substitution approach for the min-max regret multidimensional knapsack problem
(IEEE International Conference on Industrial Engineering and Engineering Management (IEEM) 2016)