3 papers
cs.CG2026
MergeDJD: A Fast Constructive Algorithm with Piece Merging for the Two-Dimensional Irregular Bin Packing Problem
Yi Zhou, Haocheng Fu, Yiping Liu +3
The two-dimensional irregular bin packing problem (2DIBPP) aims to pack a given set of irregular polygons, referred to as pieces, into fixed-size rectangular bins without overlap,…
cs.DS2025
A Branch-and-Bound Approach for Maximum Low-Diameter Dense Subgraph Problems
Yi Zhou, Chunyu Luo, Zhengren Wang +1
A graph with vertices is an -dense graph if it has at least edges, being a well-defined function. The notion -dense graph encompasses vari…
cs.DS2025
Efficient Branch-and-Bound for Submodular Function Maximization under Knapsack Constraint
Yimin Hao, Yi Zhou, Chao Xu +1
The submodular knapsack problem (SKP), which seeks to maximize a submodular set function by selecting a subset of elements within a given budget, is an important discrete optimizat…