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: 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 ...

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: This paper introduces a novel solution to hand-eye calibration problem. It is the first method that uses camera measurements directly and at the same time requires neither prior knowledge of ...

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 ...

ABSTRACT: For solving assignment problems of staff, equipment and task in engineering support action, a 3-Dimensional assignment model is established, which contains staff skill level, equipment ...