Pierre Laroche

According to our database, Pierre Laroche authored at least 19 papers between 1987 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

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., January, 2024

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 algorithms for minimizing the maximum lateness and makespan on parallel machines.

Gais Alhadi, Imed Kacem, Pierre Laroche, Izzeldin M. Osman

Ann. Oper. Res., 2020

Exact and Heuristic Solutions to the Connected k-Partitioning Problem.

Patrick Healy, Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka

Proceedings of the 7th International Conference on Control, 2020

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

Genetic Algorithm for Open Shop Scheduling Problem.

Yacine Benziani, Imed Kacem, Pierre Laroche

Proceedings of the 5th International Conference on Control, 2018

Maximum Lateness Minimization on Two-Parallel Machine with a Non-availability Interval.

Gais Alhadi, Imed Kacem, Pierre Laroche, Izzeldin M. Osman

Proceedings of the 5th International Conference on Control, 2018

2017

Bipartite complete matching vertex interdiction problem with incompatibility constraints: Complexity and heuristics.

Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka

Proceedings of the 4th International Conference on Control, 2017

2016

Foreword - Advanced Optimization Approaches and Modern OR-Applications.

Imed Kacem, Hans Kellerer, Pierre Laroche

RAIRO Oper. Res., 2016

2014

Bipartite Complete Matching Vertex Interdiction Problem: Application to Robust Nurse Assignment.

Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka

Proceedings of the International Conference on Control, 2014

2013

Lower bounds for the makespan minimization in job shops.

Yacine Benziani, Imed Kacem, Pierre Laroche, Anass Nagih

Proceedings of 10th IEEE International Conference on Networking, Sensing and Control, 2013

2001

GraphMDP: A New Decomposition Tool for Solving Markov Decision Processes.

Pierre Laroche

Int. J. Artif. Intell. Tools, 2001

A new decomposition technique for solving Markov decision processes.

Pierre Laroche, Yann Boniface, René Schott

Proceedings of the 2001 ACM Symposium on Applied Computing (SAC), 2001

2000

Processus décisionnels de Markov appliqués à la planification sous incertitude.

Pierre Laroche

PhD thesis, 2000

Building efficient partial plans using Markov decision processes.

Pierre Laroche

Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2000), 2000

1999

Mobile Robotics Planning Using Abstract Markov Decision Processes.

Pierre Laroche, François Charpillet, René Schott

Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence, 1999

1998

State aggregation for solving Markov decision problems an application to mobile robotics.

Pierre Laroche, François Charpillet

Proceedings of the Tenth IEEE International Conference on Tools with Artificial Intelligence, 1998

Mobile Robot Localization in Dynamic Environments using Places Recognition.

Olivier Aycard, Pierre Laroche, François Charpillet

Proceedings of the IEEE International Conference on Robotics and Automation, 1998

1987

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, Steve Bellenot

Proceedings of the Eleventh ACM Symposium on Operating System Principles, 1987