Skip to Main content Skip to Navigation
Journal articles

Minimalist And Customisable Optimisation Package

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03168856
Contributor : Jérôme Buisine Connect in order to contact the contributor
Submitted on : Sunday, March 14, 2021 - 7:45:02 PM
Last modification on : Monday, December 20, 2021 - 3:35:05 AM

File

10.21105.joss.02812.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Jérôme Buisine, Samuel Delepoulle, Christophe Renaud. Minimalist And Customisable Optimisation Package. Journal of Open Source Software, Open Journals, 2021, 6, ⟨10.21105/joss.02812⟩. ⟨hal-03168856⟩

Share

Metrics

Record views

32

Files downloads

21