• Algoritmos paralelos de memoria compartida que determinan el menor tama˜no de un ´arbol binario al refinar un simplex regular 

      Aparicio, Guillermo; Salmerón, José Manuel; González-Casado, Leocadio; Asenjo-Plaza, Rafael; García-Fernández, Inmaculada; [et al.] (2015-10-05)
      En el ambito de la optimizacion global basada en tecnicas de ramificacion y acotacion, cuando el espacio de busqueda es un n-sımplex regular es habitual utilizar como regla de division la biseccion por el lado mayor, ...
    • Aspectos computacionales en la bisección de un n-simplex regular. 

      Aparicio, Gillermo; Casado, Leocadio G.; García-Fernández, Inmaculada; Hendrix, Eligius Maria Theodorus; Toth, B.G. (2013-11-05)
      En el ambito de la optimizacion global basada en tecnicas de ramificacion y acotacion, cuando el espacio de busqueda es un n-simplex regular es habitual utilizar como regla de division la biseccion por el lado mayor. ...
    • Branch and Bound algorithms in greenhouse climate control 

      Hermelink, Marleen (2016-06-28)
      The horticultural sector has become an increasingly important sector of food production, for which greenhouse climate control plays a vital role in improving its sustainability. One of the methods to control the greenhouse ...
    • Computational methods and parallel strategies in dynamic decision making 

      Gutiérrez-Alcoba, Alejandro (UMA Editorial, 2018)
      Esta tesis analiza aplicaciones de toma de decisiones dinámica para un conjunto de problemas. Pueden diferenciarse dos líneas principales. La primera trata problemas de gestión de la cadena de suministro para productos ...
    • Decomposition methods for mixed-integer nonlinear programming 

      Muts, Pavlo (UMA Editorial, 2021-11-05)
      La programación no lineal de enteros mixtos es un campo de optimización importante y desafiante. Este tipo de problemas pueden contener variables continuas e enteras, así como restricciones lineales y no lineales. Esta ...
    • Generating order policies by SDP: non-stationary demand and service level constraints 

      Pauls-Worm, Karin G.J.; Hendrix, Eligius Maria Theodorus (2015-07-06)
      Inventory control implies dynamic decision making. Therefore, dynamic programming seems an appropriate approach to look for order policies. For finite horizon planning, the implementation of service level constraints ...
    • Heuristics for Longest Edge Selection in Simplicial Branch and Bound 

      Herrera, Juan F.R.; Casado, Leocadio G.; Hendrix, Eligius Maria Theodorus; García-Fernández, Inmaculada (2015-07-06)
      Simplicial partitions are suitable to divide a bounded area in branch and bound. In the iterative re nement process, a popular strategy is to divide simplices by their longest edge, thus avoiding needle-shaped simplices. ...
    • Implementaciones paralelas para un problema de control de inventarios de productos perecederos 

      Gutiérrez Alcoba, Alejandro; Hendrix, Eligius Maria Theodorus; García-Fernández, Inmaculada; Ortega, Gloria (2015-10-05)
      En este trabajo se analizan y eval uan dos implementaciones de un algoritmo de optimizaci on para un problema de control de inventarios de productos perecederos. Las implementaciones se han llevado a cabo utilizando ...
    • Inventory control for a non-stationary demand perishable product: comparing policies and solution methods 

      Hendrix, Eligius Maria Theodorus; Pauls-Worm, Karin G.J (2018-03-02)
      This paper summarizes our findings with respect to order policies for an inventory control problem for a perishable product with a maximum fixed shelf life in a periodic review system, where chance constraints play a role. ...
    • Modelling vessel fleet composition for maintenance operations at offshore wind farms 

      Gutiérrez-Alcoba, Alejandro; García-Fernández, Inmaculada; Ortega López, Gloria; Hendrix, Eligius Maria Theodorus (2018-12-20)
      Chartering a vessel fleet to support maintenance operations at offshore wind farms (OWF's) constitutes one of the major costs of maintaining this type of installations. Literature describes deterministic optimization models ...
    • On computational procedures for Value Iteration in inventory control 

      Kortenhorst, Cleo; Ortega, Gloria L; Hendrix, Eligius Maria Theodorus (2019-09-11)
      Dynamic programming (DP) is often seen in inventory control to lead to optimal ordering policies. When considering stationary demand, Value Iteration (VI) may be used to derive the best policy. In this paper, our focus is ...
    • On multimodality of obnoxious faclity location models 

      Frank, Ditte (2016-07-21)
      Obnoxious single facility location models are models that have the aim to find the best location for an undesired facility. Undesired is usually expressed in relation to the so-called demand points that represent locations ...
    • Optimization Models in WindFarm Design: The case of a routing-location problem 

      Orthodoxou, Demetra (2016-05-03)
      Wind energy can lead to a great socio-economic impact in Europe nowadays, while the installed capacity of wind power is estimated to be doubled by 2030.In order to generate power from the wind, a set of wind turbines is ...
    • Paralelismo de datos en la obtención de Tablas de Control de Tráfico con información de llegada 

      Herrera, Juan Francisco R.; Casado, Leocadio G.; Haijema, Rene; Hendrix, Eligius Maria Theodorus (2014-09-24)
      Los semáforos se pueden controlar de forma dinámica a través de varias reglas que dictaminan el color del semáforo segun el número de vehículos a la espera. Estas reglas o acciones se recogen en lo que se conoce como ...
    • Robust solutions of bi-blend recipe optimization with quadratic constraints 

      Niewerth, Freek (2016-07-20)
      Production companies use raw materials to compose end-products. They often make different products with the same raw materials. In this research, the focus lies on the production of two end-products consisting of (partly) ...
    • Robustness in facility location 

      Van Lokven, Sander W.M. (2016-07-21)
      Facility location concerns the placement of facilities, for various objectives, by use of mathematical models and solution procedures. Almost all facility location models that can be found in literature are based on ...
    • Value Iteration for Perishable Inventory Control 

      Kortenhorst, Cleo G.F. (2019-05-13)
      This thesis focuses on finding optimal order policies for perishable inventory in supermarkets. By means of value iteration (VI) and simulation, several inventory dynamics are compared. First, several cases were designed: ...