11 citations · 14 across the 2 of their papers we have counts for
1 paper · 1 filter
Qingyu Qu, Xijun Li, Yunfan Zhou +6
Most combinatorial optimization problems can be formulated as mixed integer linear programming (MILP), in which branch-and-bound (B\&B) is a general and widely used method. Recentl…