Buscar en RiuNet

Listar

Todo RiuNet

Mi cuenta

Acceder

Ayuda RiuNet

Admin. UPV

Listar por autor "Climent Aunés, Laura Isabel"

Mostrando ítems 1-6 de 6

A hybrid metaheuristic with learning for a real supply chain scheduling problem

Pérez, Christian; Climent, Laura; Nicoló, Giancarlo; Arbelaez, Alejandro; Salido, Miguel A. (Elsevier, 2023-11)

[EN] In recent decades, research on supply chain management (SCM) has enabled companies to improve their environmental, social, and economic performance.This paper presents an industrial application of logistics that can ...
Búsqueda de Soluciones Robustas en Problemas de Satisfacción de Restricciones Dinámicos

Climent Aunés, Laura Isabel (Universitat Politècnica de València, 2011-09-21)

Desarrollo de dos métodos de búsquesa de soluciones robustas para problemas de satisfacción de restricciones dinámicos. Los métodos se basan en modelar estos problemas como problemas de satisfacción de restricciones ponderados.
Finding robust solutions for constraint satisfaction problems with discrete and ordered domains by coverings

Climent Aunés, Laura Isabel; Wallace, Richard J.; Salido Gregorio, Miguel Angel; Barber Sanchís, Federico (Springer Verlag (Germany), 2013-08)

Constraint programming is a paradigm wherein relations between variables are stated in the form of constraints. Many real life problems come from uncertain and dynamic environments, where the initial constraints and ...
Robustness and Stability in Constraint Programming under Dynamism and Uncertainty

Climent Aunés, Laura Isabel; Wallace, Richard; Salido Gregorio, Miguel Angel; Barber Sanchís, Federico (Association for the Advancement of Artificial Intelligence, 2014)

[EN] Many real life problems that can be solved by constraint programming, come from uncertain and dynamic environments. Because of the dynamism, the original problem may change over time, and thus the solution found for ...
Robustness and stability in dynamic constraint satisfaction problems

Climent Aunés, Laura Isabel (Universitat Politècnica de València, 2014-01-07)

Constraint programming is a paradigm wherein relations between variables are stated in the form of constraints. It is well-known that many real life problems can be modeled as Constraint Satisfaction Problems (CSPs). Much ...
Robustness in Dynamic Constraint Satisfaction Problems

Climent Aunés, Laura Isabel; Salido Gregorio, Miguel Angel; Barber Sanchís, Federico (ICIC International, 2012)

[EN] Constraint programming is a successful technology for solving combinatorial problems modeled as constraint satisfaction problems (CSPs). Many real life problems are dynamic, which means that the initial description ...