A new exact algorithm for bi-objective linear integer problems is presented, based on the classic - constraint method and ...

We explain how to compute all the solutions of a nonlinear integer problem using the algebraic test-sets associated to some linear subproblem. These test-sets are obtained using Gr¨obner bases. We compare our method with previous approaches

We explain how to compute all the solutions of a nonlinear integer problem using the algebraic test-sets associated to a ...

En esta memoria se presenta un nuevo método algebraico para resolver de forma exacta problemas de programación multiobjetivo ...

Many problems in engineering design involve the use of nonlinearities and some integer variables. Methods based on test ...

The redundancy allocation problem is formulated minimizing the design cost for a series-parallel system with multiple ...

The redundancy allocation problem is formulated minimizing the design cost for a series-parallel system with multiple ...

Integer variables allow the treatment of some portfolio optimization problems in a more realistic way and introduce the ...

Realizamos un análisis del juego conocido por el herbolario. Se modeliza su solución mediante un sistema polinómico, y deducimos el número de soluciones a partir de herramientas de Álgebra Conmutativa.

We describe an algorithm deciding if the annihilating ideal of the meromorphic function 1 f , where f = 0 defines an ...

Let OX (resp. DX) be the sheaf of holomorphic functions (resp. the sheaf of linear differential operators with holomorphic ...

Let C[x] = C[x1, . . . , xn] be the ring of polynomials with complex coefficients and An the Weyl algebra of order n over ...

Let $G$ be a group given by generators and relations. It is possible to compute a presentation matrix of a module over a ...

Sudoku is a logic-based placement puzzle. We recall how to translate this puzzle into a 9-colouring problem which is equivalent ...

Let $f_1,\ldots, f_p$ be polynomials in ${\bf C}[x_1,\ldots, x_n]$ and let $D = D_n$ be the $n$-th Weyl algebra. The ...

Let D, x be a free divisor germ in a complex manifold X of dimension n > 2. It is an open problem to find out which are ...

Let f1, . . . , fp be polynomials in C[x1, . . . , xn] and let D = Dn be the n-th Weyl algebra. We provide upper bounds ...

In this paper we compare the approach of Brianc¸onand Maisonobe for computing Bernstein–Sato ideals—based on computations ...

We prove a duality theorem for some logarithmic D-modules associated with a class of divisors. We also give some results for the locally quasi-homogeneous case.

The relationship between D-modules and free divisors has been studied in a general setting by L. Narváez and F.J. Calderón. ...

We prove in an explicit way a duality formula between two A2-modules Mlog and Mflog associated to a plane curve and we ...

We apply algorithmic techniques for comparing some D-modules associated to a kind of divisors in Cn.

Let D be a divisor in Cn. We present methods to compare the D-module of the meromorphic functions O[∗D] to some natural approximations. We show how the analytic case can be treated with computations in the Weyl algebra.

We prove a duality formula for two D-modules arising from logarithmic derivations w.r.t. a plane curve. As an application we give a differential proof of a logarithmic comparison theorem in [4].