Summary: 5 Accepted Papers:
【JCR Q1, ABS 4】European Journal of Operational Research — 1 paper
【JCR Q1, ABS 3】Computers & Operations Research — 2 papers
【JCR Q1, ABS 3】International Journal of Production Research — 1 paper
【JCR Q2, CCF A】IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems — 1 paper
Notes: * Corresponding Author; # (Co-)Supervised MSc/PhD Students or Postdoctoral Fellows
5. Wang, S., Wang, R., Zhang, H., Jing, F., Liu, Q., & Wei, L.* (2025). A goal-driven iterated local search approach based on the maximal-space for the circle bin-packing problem with rectangular items. Computers & Operations Research, 186, 107301. [JCR Q1, ABS 3] [GitHub]
4. Wang, S., Qiu, Q., Zhang, H., Wei, L.*, & Liu, Q.* (2025). An efficient algorithm for exact SRAM verification via novel pattern matching techniques. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. [JCR Q2, CCF A] [GitHub]
3. Wang, S., Baldacci, R., Liu, Q., & Wei, L.* (2025). EATKG: An Open-Source Efficient Exact Algorithm for the Two-Dimensional Knapsack Problem with Guillotine Constraints. European Journal of Operational Research, 327, 735-753. [JCR Q1, ABS 4] [GitHub]
2. Yao, S., Wang, S., Zhang, T., Wei, L.*, & Liu, Q. (2025). A combinatorial Benders decomposition approach for the constrained two-dimensional guillotine cutting problem with defects. International Journal of Production Research, 63, 8593-8610. [JCR Q1, ABS 3]
1. Wang, S., Yao, S., Zhang, H., Liu, Q., & Wei, L.* (2025). Arc-flow formulation and branch-and-price-and-cut algorithm for the bin-packing problem with fragile objects. Computers & Operations Research, 173, 106878. [JCR Q1, ABS 3] [GitHub]
Summary: 7 Ongoing Papers:
Notes: * Corresponding Author; # (Co-)Supervised MSc/PhD Students or Postdoctoral Fellows
In-Review Papers:
Wang, S., Baldacci, R., Furini, F., Wei, L., & Liu, Q. (2025). Exact algorithms for two-dimensional knapsack problems: A unified framework with new benchmark results. INFORMS Journal on Computing. (Under Minor Revision)
Wang, S., Baldacci, R., Furini, F., Wei, L., & Liu, Q. (2025). A highly efficient numerically exact algorithm for two‑dimensional bin-packing problems. Operations Research. (1st Under Review)
Working Papers:
Wang, S., You, Z.*, Baldacci, R., Wei, L.*, & Xu, Z. A unified exact algorithm with novel bounding techniques for solving vehicle routing problems with two-dimensional loading constraints. Targeted at Transportation Science.
Wang, S., Baldacci, R., Furini, F., Wei, L.*, & Xu, Z. A numerically exact branch-price-and-cut algorithm for two-dimensional bin-packing problems with variable bin sizes and costs. Targeted at European Journal of Operational Research.
Zhang, W.#, Wang, S. (Co-First), Wei, L.*, & Liu, Q. A new branch-and-price-based heuristic algorithm for the three-dimensional bin-packing problem with stacking constraints. Targeted at International Journal of Production Research.
Zhang, T.#, Wang, S. (Co-First), Wei, L.*, & Liu, Q. An efficient branch-price-and-cut algorithm for the variable-sized bin packing problem with time windows. Targeted at Computers & Industrial Engineering.
Chen, Z.#, Wang, S. (Co-First), Yi, H., Zhang, H.*, Liu, Q., & Wei, L.* (2025) Learning-driven skyline-based variable neighborhood search for fast floorplanning. Targeted at IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.