The "branch-and-bound" algorithm for the exact solution of a three-machine scheduling problem proposed by Lomnicki has been generalized to the case of an arbitrary number of machines (under the ...
Abstract: We propose an algorithm that exactly solves the cardinality-constrained sparse spectral unmixing problem. Based on recent works on $\ell_{0}$-norm exact optimization, a branch-and-bound ...
This paper considers a production planning problem in disassembly systems, which is the problem of determining the quantity and timing of disassembling end-of-use/life products in order to satisfy the ...
Abstract: Programmable metasurfaces have emerged as a revolutionary technology with the flexibility to manipulate electromagnetic (EM) waves. They have attracted great interest in fields, including ...
ReviBranch is a novel deep reinforcement learning framework for Mixed Integer Linear Programming (MILP) branching variable selection. It addresses three fundamental challenges in learning-based ...