Pierre Laroche

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