Author profile: Ucha Enríquez, José María
Institutional data
Name | Ucha Enríquez, José María |
Department | Matemática Aplicada I |
Knowledge area | Matemática Aplicada |
Professional category | Profesor Titular de Universidad |
Request | |
Statistics
-
No. publications
26
-
No. visits
3387
-
No. downloads
4234
Publications |
---|
Article
An exact algebraic ϵ-constraint method for bi-objective linear integer programming based on test sets
(Elsevier, 2020)
A new exact algorithm for bi-objective linear integer problems is presented, based on the classic - constraint method and ... |
Article
Finding multiplies solutions for non-linear integer programming
(Elsevier, 2018)
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 |
Presentation
Finding Multiple Solutions in Nonlinear Integer Programming with Algebraic Test-Sets
(Springer, 2018)
We explain how to compute all the solutions of a nonlinear integer problem using the algebraic test-sets associated to a ... |
PhD Thesis
Métodos algebraicos basados en test-sets para optimización lineal entera multiobjetivo
(2017)
En esta memoria se presenta un nuevo método algebraico para resolver de forma exacta problemas de programación multiobjetivo ... |
Article
An improved test set approach to nonlinear integer problems with applications to engineering design
(Springer, 2015)
Many problems in engineering design involve the use of nonlinearities and some integer variables. Methods based on test ... |
Article
Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method
(2013)
The redundancy allocation problem is formulated minimizing the design cost for a series-parallel system with multiple ... |
Article
Exact cost minimization of a series-parallel system
(Cornell University, 2012)
The redundancy allocation problem is formulated minimizing the design cost for a series-parallel system with multiple ... |
Article
An algebraic approach to Integer Portfolio problems
(2011)
Integer variables allow the treatment of some portfolio optimization problems in a more realistic way and introduce the ... |
Presentation
The Chemist's Cabinet Puzzle: a polynomial approach
(Universidad de Granada. Departamento de Álgebra, 2008)
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. |
Article
Localization at hyperplane arrangements: combinatorics and D-modules
(Elsevier, 2007)
We describe an algorithm deciding if the annihilating ideal of the meromorphic function 1 f , where f = 0 defines an ... |
Article
A vanishing theorem for a class of logarithmic D-modules
(Cornell University, 2007)
Let OX (resp. DX) be the sheaf of holomorphic functions (resp. the sheaf of linear differential operators with holomorphic ... |
Article
Gröbner bases and logarithmic D-modules
(Elsevier, 2006)
Let C[x] = C[x1, . . . , xn] be the ring of polynomials with complex coefficients and An the Weyl algebra of order n over ... |
Chapter of Book
Algorithmic Invariants for Alexander Modules
(2006)
Let $G$ be a group given by generators and relations. It is possible to compute a presentation matrix of a module over a ... |
Chapter of Book
Sudokus and Gröbner Bases: not only a Divertimento
(2006)
Sudoku is a logic-based placement puzzle. We recall how to translate this puzzle into a 9-colouring problem which is equivalent ... |
Chapter of Book
Nouvelle Cuisine for the Computation of the Annihilating Ideal of $f^s$
(2005)
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 ... |
Article
Logarithmic Comparison Theorem and some Euler homogeneous free divisors
(American Mathematical Society, 2005)
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 ... |
Article
Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials
(2005)
Let f1, . . . , fp be polynomials in C[x1, . . . , xn] and let D = Dn be the n-th Weyl algebra. We provide upper bounds ... |
Article
On the computation of Bernstein–Sato ideals
(Elsevier, 2004)
In this paper we compare the approach of Brianc¸onand Maisonobe for computing Bernstein–Sato ideals—based on computations ... |
Article
Testing the Logarithmic Comparison Theorem for Free Divisors
(Taylor and Francis, 2004)
|
Article
Quasi-free divisors and duality
(Elsevier, 2004)
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. |
Article
Free divisors and duality for D-modules
(Pleiades, 2002)
The relationship between D-modules and free divisors has been studied in a general setting by L. Narváez and F.J. Calderón. ... |
Article
Explicit Comparison Theorems for D -modules
(Elsevier, 2001)
We prove in an explicit way a duality formula between two A2-modules Mlog and Mflog associated to a plane curve and we ... |
Presentation
A computational approach to free divisors and logarithmic D-modules
(Universidad de La Rioja, Departamento de Matemáticas y Computación, 2001)
We apply algorithmic techniques for comparing some D-modules associated to a kind of divisors in Cn. |
Article
A computational approach to the D-module of meromorphic functions
(2001)
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. |
Article
On some D-modules in dimension 2
(Cornell University, 2000)
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]. |
PhD Thesis |