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
Pablo García Gómez, Stéphane Dauzère-Pérès, Camino Vela, Inés González-Rodríguez - 1 février 2026
New bounds for move evaluation in the flexible job-shop scheduling problem
Computers & Industrial Engineering
Adrien Wartelle, Quentin Christ, Stéphane Dauzère-Pérès, Renaud Roussel, Claude Yugma - 21 janvier 2026
Modelling the impact of lot priorities on production cycle times: a data-driven approach
International Journal of Production Research
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
Victor Charpenay, Mansour Zoubeirou a Mayaki, Antoine Zimmermann - 31 mars 2026
On the Computational Cost of Knowledge Graph Embeddings
Transactions on Graph Data and Knowledge
Dipayan Chakraborty, Florent Foucaud, Michael Henning, Tuomo Lehtilä - 1 février 2026
Identifying codes in graphs of given maximum degree: Characterizing trees
Discrete Mathematics
New bounds for move evaluation in the flexible job-shop scheduling problem
Computers & Industrial Engineering
Adrien Wartelle, Quentin Christ, Stéphane Dauzère-Pérès, Renaud Roussel, Claude Yugma - 21 janvier 2026
Modelling the impact of lot priorities on production cycle times: a data-driven approach
International Journal of Production Research
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
Victor Charpenay, Mansour Zoubeirou a Mayaki, Antoine Zimmermann - 31 mars 2026
On the Computational Cost of Knowledge Graph Embeddings
Transactions on Graph Data and Knowledge
Dipayan Chakraborty, Florent Foucaud, Michael Henning, Tuomo Lehtilä - 1 février 2026
Identifying codes in graphs of given maximum degree: Characterizing trees
Discrete Mathematics