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: 10 Ongoing Papers:
Notes: * Corresponding Author; # (Co-)Supervised MSc/PhD Students or Postdoctoral Fellows
Submitted Papers:
Wang, S., Baldacci, R., Furini, F., Wei, L.*, & Liu, Q. Exact Algorithms for Two-Dimensional Knapsack Problems: A Unified Framework with New Benchmark Results. INFORMS Journal on Computing. (Accepted)
Wang, S., Baldacci, R., Furini, F., Wei, L.*, & Liu, Q. A Highly Efficient Numerically Exact Algorithm for Two-Dimensional Bin-Packing Problems. Operations Research. (Under Major Revision)
Wang, S., You, Z., Baldacci, R., Mo, B., Qin, H., Wei, L.*, & Xu, Z. PrecPack: An Efficient Open-Source Exact Solver for Bin Packing with Generalized Precedence Constraints. INFORMS Journal on Computing. (Under Review)
Zhang, T.#, Wang, S. (Co-First), Wei, L.*, Zhang, R., Qin, H., Wu, X., & Liu, Q. A Unified Branch-Price-and-Cut Algorithm for Variable-Sized Bin Packing with Conflicts or Time Windows. European Journal of Operational Research. (Under Review)
Working Papers:
Wang, S., Xu, Z., & Fu, X. A Branch-Price-Enumerate-and-Switch Algorithm for Team Formation and Routing Problems.
Wang, S., Baldacci, R., Furini, F., Wei, L.*, & Xu, Z. High-Dimensional Heterogeneous Bin Packing: Tightened Formulations, Numerically Safe Lower Bounds, and an Efficient Exact Algorithm.
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.
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.
Chen, Z.#, Wang, S. (Co-First), Yi, H., Zhang, H.*, Liu, Q., & Wei, L.* Learning-driven skyline-based variable neighborhood search for fast floorplanning.
Xu, J., Deng, J.#, Wang, S., Lin, G., Chen, Z., & Liu, Z. Capacity Allocation and Order Acceptance with Just-in-Time Scheduling in Distributed Factories.