Pierre Laroche - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 20 from 20

2024

Approximation schemes for scheduling jobs on identical parallel machines to minimize the maximum lateness and makespanGais Alhadi, Imed Kacem, Pierre Laroche, Izzeldin M. Osman. rairo, 58(3):2393-2419, 2024. [doi]

A branch-and-cut algorithm for the connected max-k-cut problemPatrick Healy, Nicolas Jozefowiez, Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka. eor, 312(1):117-124, January 2024. [doi]

2020

2018

Maximum Lateness Minimization on Two-Parallel Machine with a Non-availability IntervalGais Alhadi, Imed Kacem, Pierre Laroche, Izzeldin M. Osman. codit 2018: 757-762 [doi]

Genetic Algorithm for Open Shop Scheduling ProblemYacine Benziani, Imed Kacem, Pierre Laroche. codit 2018: 935-939 [doi]

A Clustering-based Approach for Balancing and Scheduling Bicycle-sharing SystemsImed Kacem, Ahmed Abdelmoumene Kadri, Pierre Laroche. iasc, 24(2):421-430, 2018. [doi]

2017

Bipartite complete matching vertex interdiction problem with incompatibility constraints: Complexity and heuristicsPierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka. codit 2017: 6-11 [doi]

2016

Foreword - Advanced Optimization Approaches and Modern OR-ApplicationsImed Kacem, Hans Kellerer, Pierre Laroche. rairo, 50(4-5):677-679, 2016. [doi]

2014

Bipartite Complete Matching Vertex Interdiction Problem: Application to Robust Nurse AssignmentPierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka. codit 2014: 182-187 [doi]

2013

Lower bounds for the makespan minimization in job shopsYacine Benziani, Imed Kacem, Pierre Laroche, Anass Nagih. icnsc 2013: 442-445 [doi]

2001

GraphMDP: A New Decomposition Tool for Solving Markov Decision ProcessesPierre Laroche. ijait, 10(3):325-343, 2001.

A new decomposition technique for solving Markov decision processesPierre Laroche, Yann Boniface, René Schott. SAC 2001: 12-16 [doi]

2000

Building efficient partial plans using Markov decision processesPierre Laroche. ictai 2000: 156-163 [doi]

Processus décisionnels de Markov appliqués à la planification sous incertitudePierre Laroche. PhD thesis, Henri Poincaré University, Nancy, France, 2000. [doi]

1999

Mobile Robotics Planning Using Abstract Markov Decision ProcessesPierre Laroche, François Charpillet, René Schott. ictai 1999: 299-306 [doi]

1998

Mobile Robot Localization in Dynamic Environments using Places RecognitionOlivier Aycard, Pierre Laroche, François Charpillet. icra 1998: 3135-3140

State aggregation for solving Markov decision problems an application to mobile roboticsPierre Laroche, François Charpillet. ictai 1998: 384-391 [doi]

1987

Distributed Simulation and the Time Wrap Operating SystemDavid 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. sosp 1987: 77-93

Sign in or sign up to see more results.

runs on WebDSL