Shaowen Yao

Orcid: 0009-0008-0524-5724

Affiliations:
  • Guangdong University of Technology, Guangzhou, China


According to our database1, Shaowen Yao authored at least 11 papers between 2023 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

2023
2024
2025
0
1
2
3
4
5
6
3
5
3

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
The semi-online robotic pallet loading problem.
Comput. Oper. Res., 2025

Arc-flow formulation and branch-and-price-and-cut algorithm for the bin-packing problem with fragile objects.
Comput. Oper. Res., 2025

An exact approach for the two-dimensional strip packing problem with defects.
Comput. Ind. Eng., 2025

2024
Heuristic approaches for the cutting path problem.
Expert Syst. Appl., March, 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
Exact approaches for the unconstrained two-dimensional cutting problem with defects.
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


  Loading...