Pierre Laroche

ORCID

Publication Activity (10 Years)

Years Active: 1987-2024
Publications (10 Years): 10

Top Venues

Henri Poincaré University, Nancy, France (PHD)

Education History

Henri Poincaré University, Nancy, France

PHD

Publications

Patrick Healy, Nicolas Jozefowiez, Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka
A branch-and-cut algorithm for the connected max-k-cut problem. Eur. J. Oper. Res. 312 (1) (2024)
Gais Alhadi, Imed Kacem, Pierre Laroche, Izzeldin M. Osman
Approximation schemes for scheduling jobs on identical parallel machines to minimize the maximum lateness and makespan. RAIRO Oper. Res. 58 (3) (2024)
Gais Alhadi, Imed Kacem, Pierre Laroche, Izzeldin M. Osman
Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines. Ann. Oper. Res. 285 (1) (2020)
Patrick Healy, Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka
Exact and Heuristic Solutions to the Connected k-Partitioning Problem. CoDIT (2020)
Pierre Laroche, Franc Marchetti, Sébastien Martin, Anass Nagih, Zsuzsanna Róka
Multiple Bipartite Complete Matching Vertex Blocker Problem: Complexity, polyhedral analysis and Branch-and-Cut. Discret. Optim. 35 (2020)
Gais Alhadi, Imed Kacem, Pierre Laroche, Izzeldin M. Osman
Maximum Lateness Minimization on Two-Parallel Machine with a Non-availability Interval. CoDIT (2018)
Yacine Benziani, Imed Kacem, Pierre Laroche
Genetic Algorithm for Open Shop Scheduling Problem. CoDIT (2018)
Gais Alhadi, Imed Kacem, Pierre Laroche, Izzeldin M. Osman
An Approximate Pareto Set for Minimizing the Maximum Lateness and Makespan on Parallel Machines. CoRR (2018)
Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka
Bipartite complete matching vertex interdiction problem with incompatibility constraints: Complexity and heuristics. CoDIT (2017)
Imed Kacem, Hans Kellerer, Pierre Laroche
Foreword - Advanced Optimization Approaches and Modern OR-Applications. RAIRO Oper. Res. 50 (4-5) (2016)
Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka
Bipartite Complete Matching Vertex Interdiction Problem: Application to Robust Nurse Assignment. CoDIT (2014)
Yacine Benziani, Imed Kacem, Pierre Laroche, Anass Nagih
Lower bounds for the makespan minimization in job shops. ICNSC (2013)
Pierre Laroche
GraphMDP: A New Decomposition Tool for Solving Markov Decision Processes. Int. J. Artif. Intell. Tools 10 (3) (2001)
Pierre Laroche, Yann Boniface, René Schott
A new decomposition technique for solving Markov decision processes. SAC (2001)
Pierre Laroche
Building efficient partial plans using Markov decision processes. ICTAI (2000)
Pierre Laroche, François Charpillet, René Schott
Mobile Robotics Planning Using Abstract Markov Decision Processes. ICTAI (1999)
Olivier Aycard, Pierre Laroche, François Charpillet
Mobile Robot Localization in Dynamic Environments using Places Recognition. ICRA (1998)
Pierre Laroche, François Charpillet
State aggregation for solving Markov decision problems an application to mobile robotics. ICTAI (1998)
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, Steve Bellenot
Distributed Simulation and the Time Wrap Operating System. SOSP (1987)

Pierre Laroche.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Pierre Laroche