Distributed Simulation and the Time Wrap Operating System. - David R. Jefferson; Brian Beckman; Frederick Wieland; Leo Blume; Mike Di Loreto; Phil Hontalas; Pierre Laroche; Kathy Sturdevant; Jack Tupman; L. Van Warren; John J. Wedel; Herb Younger; et al. (SOSP, 1987)

Mobile Robot Localization in Dynamic Environments using Places Recognition. - Olivier Aycard; Pierre Laroche; François Charpillet (ICRA, 1998)

State aggregation for solving Markov decision problems an application to mobile robotics. - Pierre Laroche; François Charpillet (ICTAI, 1998)

Mobile Robotics Planning Using Abstract Markov Decision Processes. - Pierre Laroche; François Charpillet; René Schott (ICTAI, 1999)

Building efficient partial plans using Markov decision processes. - Pierre Laroche (ICTAI, 2000)

Processus décisionnels de Markov appliqués à la planification sous incertitude. - Pierre Laroche (2000)

A new decomposition technique for solving Markov decision processes. - Pierre Laroche; Yann Boniface; René Schott (SAC, 2001)

GraphMDP: A New Decomposition Tool for Solving Markov Decision Processes. - Pierre Laroche (Int. J. Artif. Intell. Tools, 2001)

Lower bounds for the makespan minimization in job shops. - Yacine Benziani; Imed Kacem; Pierre Laroche; Anass Nagih (ICNSC, 2013)

Bipartite Complete Matching Vertex Interdiction Problem: Application to Robust Nurse Assignment. - Pierre Laroche; Franc Marchetti; Sébastien Martin; Zsuzsanna Róka (CoDIT, 2014)

Foreword - Advanced Optimization Approaches and Modern OR-Applications. - Imed Kacem; Hans Kellerer; Pierre Laroche (RAIRO Oper. Res., 2016)

Bipartite complete matching vertex interdiction problem with incompatibility constraints: Complexity and heuristics. - Pierre Laroche; Franc Marchetti; Sébastien Martin; Zsuzsanna Róka (CoDIT, 2017)

Maximum Lateness Minimization on Two-Parallel Machine with a Non-availability Interval. - Gais Alhadi; Imed Kacem; Pierre Laroche; Izzeldin M. Osman (CoDIT, 2018)

Genetic Algorithm for Open Shop Scheduling Problem. - Yacine Benziani; Imed Kacem; Pierre Laroche (CoDIT, 2018)

An Approximate Pareto Set for Minimizing the Maximum Lateness and Makespan on Parallel Machines. - Gais Alhadi; Imed Kacem; Pierre Laroche; Izzeldin M. Osman (CoRR, 2018)

A Clustering-based Approach for Balancing and Scheduling Bicycle-sharing Systems. - Imed Kacem; Ahmed Abdelmoumene Kadri; Pierre Laroche (Intell. Autom. Soft Comput., 2018)

Exact and Heuristic Solutions to the Connected k-Partitioning Problem. - Patrick Healy; Pierre Laroche; Franc Marchetti; Sébastien Martin; Zsuzsanna Róka (CoDIT, 2020)

Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines. - Gais Alhadi; Imed Kacem; Pierre Laroche; Izzeldin M. Osman (Ann. Oper. Res., 2020)

Multiple Bipartite Complete Matching Vertex Blocker Problem: Complexity, polyhedral analysis and Branch-and-Cut. - Pierre Laroche; Franc Marchetti; Sébastien Martin; Anass Nagih; Zsuzsanna Róka (Discret. Optim., 2020)

Approximation schemes for scheduling jobs on identical parallel machines to minimize the maximum lateness and makespan. - Gais Alhadi; Imed Kacem; Pierre Laroche; Izzeldin M. Osman (RAIRO Oper. Res., 2024)

A branch-and-cut algorithm for the connected max-k-cut problem. - Patrick Healy; Nicolas Jozefowiez; Pierre Laroche; Franc Marchetti; Sébastien Martin; Zsuzsanna Róka (Eur. J. Oper. Res., 2024)