default search action
Emmanuel Néron
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j18]Mohamed Lemine Ahmed Sidi, Ronan Bocquillon
, Hafedh Mohamed-Babou, Cheikh Dhib, Emmanuel Néron, Ameur Soukhal
Improved approaches to solve the One-To-One SkewGraM problem. Comput. Oper. Res. 138: 105584 (2022) - [j17]Yannick Kergosien
An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem. INFORMS J. Comput. 34(1): 76-92 (2022)
2010 – 2019
- 2017
- [j16]Ismaila Abderhamane Ndiaye, Emmanuel Néron, Antoine Jouglet:
Macroscopic evacuation plans for natural disasters. OR Spectr. 39(1): 231-272 (2017) - 2016
- [c4]Antoine Giret, Yannick Kergosien, Gaël Sauvanet, Emmanuel Néron:
An Efficient Label-setting Algorithm for the Bi-objective Shortest Path Problem. ICORES 2016: 197-203 - 2014
- [j15]Vincent T'kindt, Emmanuel Néron:
Preface. Ann. Oper. Res. 213(1): 1 (2014) - [j14]Mohamed Haouari
A preemptive bound for the Resource Constrained Project Scheduling Problem. J. Sched. 17(3): 237-248 (2014) - 2012
- [j13]Mohamed Haouari
Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem. Comput. Oper. Res. 39(5): 1187-1194 (2012) - 2011
- [c3]Cheikh Dhib, Anis Kooli, Ameur Soukhal, Emmanuel Néron:
Lower bounds for a multi-skill project scheduling problem. OR 2011: 471-476 - 2010
- [j12]Anis Kooli, Mohamed Haouari
IP-Based Energetic Reasoning for the Resource Constrained Project Scheduling Problem. Electron. Notes Discret. Math. 36: 359-366 (2010) - [j11]Gaël Sauvanet, Emmanuel Néron:
Search for the best compromise solution on Multiobjective shortest path problem. Electron. Notes Discret. Math. 36: 615-622 (2010)
2000 – 2009
- 2008
- [j10]Emmanuel Néron, Fabrice Tercinet, Francis Sourd:
Search tree based approaches for parallel machine scheduling. Comput. Oper. Res. 35(4): 1127-1137 (2008) - 2007
- [j9]Jacques Carlier, Emmanuel Néron:
Computing redundant resources for the resource constrained project scheduling problem. Eur. J. Oper. Res. 176(3): 1452-1463 (2007) - [j8]Jean-Charles Billaut, Emmanuel Néron:
Éditorial. RAIRO Oper. Res. 41(2): 123 (2007) - [j7]Odile Bellenguez-Morineau, Emmanuel Néron:
A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem. RAIRO Oper. Res. 41(2): 155-170 (2007) - [c2]Cédric Pessan, Jean-Louis Bouquard, Emmanuel Néron:
Genetic Branch-and-Bound or Exact Genetic Algorithm?. Artificial Evolution 2007: 136-147 - 2006
- [j6]Fabrice Tercinet, Emmanuel Néron, Christophe Lenté:
Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem. 4OR 4(4): 297-317 (2006) - 2005
- [j5]Vincent T'kindt
The e-OCEA project: towards an Internet decision system for scheduling problems. Decis. Support Syst. 40(2): 329-337 (2005) - 2004
- [j4]Fabrice Tercinet, Christophe Lenté, Emmanuel Néron:
Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines. Oper. Res. Lett. 32(4): 326-330 (2004) - [c1]Odile Bellenguez, Emmanuel Néron:
Lower Bounds for the Multi-skill Project Scheduling Problem with Hierarchical Levels of Skills. PATAT 2004: 229-243 - 2003
- [j3]Jacques Carlier, Emmanuel Néron:
On linear lower bounds for the resource constrained project scheduling problem. Eur. J. Oper. Res. 149(2): 314-324 (2003) - 2000
- [j2]Jacques Carlier, Emmanuel Néron:
A new LP-based lower bound for the cumulative scheduling problem. Eur. J. Oper. Res. 127(2): 363-382 (2000) - [j1]Jacques Carlier, Emmanuel Néron:
An Exact Method for Solving the Multi-Processor Flow-Shop. RAIRO Oper. Res. 34(1): 1-25 (2000)
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-04-25 05:59 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: