Présentation
Le Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS) est une Unité Mixte de Recherche (UMR 6158) en informatique, et plus généralement en Sciences et Technologies de l'Information et de la Communication (STIC).
(lire la suite)Dernières Publications
Khaled Medini, Julien de Benedittis, Thorsten Wuest, Mihaela Juganaru - 15 juin 2026
Operationalising agile manufacturing in the digital transformation era: towards a process-oriented, empirically grounded roadmap
International Journal of Productivity and Performance Management
Karim Terfasse, Ghassen Cherif, Marie-José Huguet - 23 février 2026
A path planning heuristic for automated guided vehicles in container terminals
RAIRO - Operations Research
Anthony Bertrand, Engelbert Mephu Nguifo, Violaine Antoine, David Hill - 2 avril 2026
A K-Means, Ward and DBSCAN Repeatability Study
Cloud Computing and Data Science
Quentin Bramas, Stéphane Devismes, Anaïs Durand, Pascal Lafourcade, Anissa Lamani - 1 septembre 2026
Optimal asynchronous perpetual finite grid exploration
Theoretical Computer Science
Dipayan Chakraborty, Florent Foucaud, Michael Antony Henning, Tero Laihonen - 13 mars 2026
A note on partitioning the vertex set of a graph into a dominating set and a locating dominating set
The Electronic Journal of Combinatorics
Operationalising agile manufacturing in the digital transformation era: towards a process-oriented, empirically grounded roadmap
International Journal of Productivity and Performance Management
Karim Terfasse, Ghassen Cherif, Marie-José Huguet - 23 février 2026
A path planning heuristic for automated guided vehicles in container terminals
RAIRO - Operations Research
Anthony Bertrand, Engelbert Mephu Nguifo, Violaine Antoine, David Hill - 2 avril 2026
A K-Means, Ward and DBSCAN Repeatability Study
Cloud Computing and Data Science
Quentin Bramas, Stéphane Devismes, Anaïs Durand, Pascal Lafourcade, Anissa Lamani - 1 septembre 2026
Optimal asynchronous perpetual finite grid exploration
Theoretical Computer Science
Dipayan Chakraborty, Florent Foucaud, Michael Antony Henning, Tero Laihonen - 13 mars 2026
A note on partitioning the vertex set of a graph into a dominating set and a locating dominating set
The Electronic Journal of Combinatorics