Identification d'un phénomène bactériologique
Integer Linear Programming applied to determining monic hyperbolic irreducible polynomials with integer coefficients and span less than 4
In this work, we propose a new method to find monic irreducible polynomials with integer coefficients, only real roots, and span less than 4. The main idea is to reduce the search of such polynomials to the solution of Integer Linear Programming problems. In this frame, the coefficients of the polynomials we are looking for are the integer unknowns. We give inequality constraints specified by the properties that the polynomials should have, such as the typical distribution of their roots. These...
Integer programming approaches for minimum stabbing problems
The problem of finding structures with minimum stabbing number has received considerable attention from researchers. Particularly, [10] study the minimum stabbing number of perfect matchings (mspm), spanning trees (msst) and triangulations (mstr) associated to set of points in the plane. The complexity of the mstr remains open whilst the other two are known to be 𝓝𝓟-hard. This paper presents integer programming (ip) formulations for these three problems, that allowed us to...
Investissement et flexibilité organisationnelle
Investment/financial planning with endogenous lifetimes : a heuristic approach to mixed-integer programming