A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
Abstract. We present a branch-and-bound (bb) algorithm for the multiple sequence alignment problem (MSA), one of the most important problems in computational biology. The upper bou...
In this article, we argue that a program transformation approach is a good way to solve the tyranny of the primary decomposition. We illustrate our transformation-based approach o...
Column generation has proven to be efficient in solving the linear programming relaxation of large scale instances ofthemultiple-depotvehicleschedulingproblem(MDVSP).Howeverdif...
Amar Oukil, Hatem Ben Amor, Jacques Desrosiers, Hi...
In this paper we discuss computational complexity and risk averse approaches to two and multistage stochastic programming problems. We argue that two stage (say linear) stochastic ...