Abstract: In this paper, we address the bin packing problem while minimizing the total loading cost of used bins. We focus on two different quantity discount schemes: the all unit discount and the ...
Abstract: Unit commitment (UC) problems are typically formulated as mixed-integer programs (MIP) and solved by the branch-and-bound (B&B) scheme. The recent advances in graph neural networks (GNN) ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results