Data

 Name Hartillo Hermoso, Isabel Department Matemática Aplicada I Knowledge area Matemática Aplicada Professional category Profesora Titular de Universidad E-mail Request

• Items

• Visits

Publications

Article

An exact algebraic ϵ-constraint method for bi-objective linear integer programming based on test sets

(Elsevier, 2020-01-01)
A new exact algorithm for bi-objective linear integer problems is presented, based on the classic - constraint method and ...
Presentation

Finding Multiple Solutions in Nonlinear Integer Programming with Algebraic Test-Sets

(Springer, 2018-01-01)
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-09-14)
En esta memoria se presenta un nuevo método algebraico para resolver de forma exacta problemas de programación multiobjetivo ...
Article

Article

An improved test set approach to nonlinear integer problems with applications to engineering design

(Springer, 2015-11-01)
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-11-01)
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-01-01)
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-05-01)
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

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

A vanishing theorem for a class of logarithmic D-modules

(Cornell University, 2007-01-01)
Let OX (resp. DX) be the sheaf of holomorphic functions (resp. the sheaf of linear differential operators with holomorphic ...
Chapter of Book

Sudokus and Gröbner Bases: not only a Divertimento

(2006-01-01)
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

Algorithmic Invariants for Alexander Modules

(2006-01-01)
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

Nouvelle Cuisine for the Computation of the Annihilating Ideal of $f^s$

(2005-01-01)
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

Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials

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

Métodos efectivos en anillos de operadores diferenciales y en sistemas hipergeométricos

(2002-01-01)
El Análisis Algebraico, o teoría de D-m&oa cute;dulos, trata el estudio de los sistemas de ecuaciones -- en derivadas ...