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

Abstract: In this paper we propose a branch-and-bound algorithm for the single-machine earliness-tardiness scheduling problem where weights for earliness and tardiness are independent of jobs. Here, ...

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