We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of...
We consider a system of m linear equations in n variables Ax = d and give necessary and sufficient conditions for the existence of a unique solution to the system that is integer:...
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...
Jean Berger, Khaled Jabeur, Abdeslem Boukhtouta, A...
We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset...
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
In this paper, we suggest a linear programming formulation that allows for solving volume and capacity planning problems in semiconductor manufacturing systems. We assume a genera...
Abstract. We propose a new boosting algorithm based on a linear programming formulation. Our algorithm can take advantage of the sparsity of the solution of the underlying optimiza...