Minimalist And Customisable Optimisation Package - Archive ouverte HAL Access content directly
Journal Articles Journal of Open Source Software Year : 2021

Minimalist And Customisable Optimisation Package


Optimisation problems are frequently encountered in science and industry. Given a real-valued function f defined on a set called the search space X, optimising the function f consists of finding a point x ∈ X that has the optimal value f (x), or at least constructing a sequence (x t) t∈N ∈ X N that is close to the optimum. Depending on the search space X, optimisation problems can be globally classified as discrete problems (e.g. X = {0, 1} n) or as continuous problems (e.g. X = R n). Tools for modelling and solving discrete (Soni, 2017) and continuous (Agarwal et al., 2020) problems are proposed in the literature.
Fichier principal
Vignette du fichier
10.21105.joss.02812.pdf (381.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03168856 , version 1 (14-03-2021)



Jérôme Buisine, Samuel Delepoulle, Christophe Renaud. Minimalist And Customisable Optimisation Package. Journal of Open Source Software, 2021, 6 (59), pp.2812. ⟨10.21105/joss.02812⟩. ⟨hal-03168856⟩
28 View
31 Download



Gmail Facebook X LinkedIn More