default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPierre Laroche
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]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): 117-124 (2024)- [j5]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): 2393-2419 (2024) - 2020
- [j4]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): 369-395 (2020) - [j3]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: 100551 (2020) - [c12]Patrick Healy, Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka:
Exact and Heuristic Solutions to the Connected k-Partitioning Problem. CoDIT 2020: 1127-1132
2010 – 2019
- 2018
- [c11]Gais Alhadi, Imed Kacem, Pierre Laroche, Izzeldin M. Osman:
Maximum Lateness Minimization on Two-Parallel Machine with a Non-availability Interval. CoDIT 2018: 757-762 - [c10]Yacine Benziani, Imed Kacem, Pierre Laroche:
Genetic Algorithm for Open Shop Scheduling Problem. CoDIT 2018: 935-939 - [i1]Gais Alhadi, Imed Kacem, Pierre Laroche, Izzeldin M. Osman:
An Approximate Pareto Set for Minimizing the Maximum Lateness and Makespan on Parallel Machines. CoRR abs/1802.10488 (2018) - 2017
- [c9]Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka:
Bipartite complete matching vertex interdiction problem with incompatibility constraints: Complexity and heuristics. CoDIT 2017: 6-11 - 2016
- [j2]Imed Kacem, Hans Kellerer, Pierre Laroche:
Foreword - Advanced Optimization Approaches and Modern OR-Applications. RAIRO Oper. Res. 50(4-5): 677-679 (2016) - 2014
- [c8]Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka:
Bipartite Complete Matching Vertex Interdiction Problem: Application to Robust Nurse Assignment. CoDIT 2014: 182-187 - 2013
- [c7]Yacine Benziani, Imed Kacem, Pierre Laroche, Anass Nagih:
Lower bounds for the makespan minimization in job shops. ICNSC 2013: 442-445
2000 – 2009
- 2001
- [j1]Pierre Laroche:
GraphMDP: A New Decomposition Tool for Solving Markov Decision Processes. Int. J. Artif. Intell. Tools 10(3): 325-343 (2001) - [c6]Pierre Laroche, Yann Boniface, René Schott:
A new decomposition technique for solving Markov decision processes. SAC 2001: 12-16 - 2000
- [b1]Pierre Laroche:
Processus décisionnels de Markov appliqués à la planification sous incertitude. Henri Poincaré University, Nancy, France, 2000 - [c5]Pierre Laroche:
Building efficient partial plans using Markov decision processes. ICTAI 2000: 156-163
1990 – 1999
- 1999
- [c4]Pierre Laroche, François Charpillet, René Schott:
Mobile Robotics Planning Using Abstract Markov Decision Processes. ICTAI 1999: 299-306 - 1998
- [c3]Olivier Aycard, Pierre Laroche, François Charpillet:
Mobile Robot Localization in Dynamic Environments using Places Recognition. ICRA 1998: 3135-3140 - [c2]Pierre Laroche, François Charpillet:
State aggregation for solving Markov decision problems an application to mobile robotics. ICTAI 1998: 384-391
1980 – 1989
- 1987
- [c1]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: 77-93
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-20 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
