Shaowen Yao
Orcid: 0009-0008-0524-5724Affiliations:
- Guangdong University of Technology, Guangzhou, China
According to our database1,
Shaowen Yao
authored at least 10 papers
between 2023 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
Arc-flow formulation and branch-and-price-and-cut algorithm for the bin-packing problem with fragile objects.
Comput. Oper. Res., 2025
2024
An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry.
Comput. Oper. Res., February, 2024
Combinatorial Benders' decomposition for the constrained two-dimensional non-guillotine cutting problem with defects.
Int. J. Prod. Res., 2024
A block-based heuristic search algorithm for the two-dimensional guillotine strip packing problem.
Eng. Appl. Artif. Intell., 2024
An Iterative Compression Method for the Two-Dimensional Irregular Packing Problem With Lead Lines.
IEEE Access, 2024
2023
Comput. Oper. Res., December, 2023
Classification model-based assisted preselection and environment selection approach for evolutionary expensive bilevel optimization.
Appl. Intell., December, 2023
An exact approach for the constrained two-dimensional guillotine cutting problem with defects.
Int. J. Prod. Res., May, 2023