default search action
Christophe Lenté
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]Guillaume Lacharme, Hubert Cardot, Christophe Lenté, Nicolas Monmarché:
The limitations of differentiable architecture search. Pattern Anal. Appl. 27(2): 40 (2024) - 2023
- [c5]Guillaume Lacharme, Hubert Cardot, Christophe Lenté, Nicolas Monmarché:
DARTS with Degeneracy Correction. IbPRIA 2023: 40-53
2010 – 2019
- 2018
- [j11]Lei Shang
, Christophe Lenté, Mathieu Liedloff, Vincent T'kindt:
Exact exponential algorithms for 3-machine flowshop scheduling problems. J. Sched. 21(2): 227-233 (2018) - 2014
- [c4]Nhat Vinh Vo
Elaboration of General Lower Bounds for the Total Completion Time in Flowshop Scheduling Problems through MaxPlus Approach. ICORES (Selected Papers) 2014: 285-299 - [c3]Nhat Vinh Vo, Pauline Fouillet, Christophe Lenté:
General Lower Bounds for the Total Completion Time in a Flowshop Scheduling Problem - MaxPlus Approach. ICORES 2014: 382-389 - 2013
- [j10]Yannick Kergosien
Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex. Comput. Oper. Res. 40(10): 2508-2518 (2013) - [j9]Christophe Lenté, Mathieu Liedloff, Ameur Soukhal, Vincent T'kindt
On an extension of the Sort & Search method with application to scheduling theory. Theor. Comput. Sci. 511: 13-22 (2013) - [c2]Nhat Vinh Vo, Christophe Lenté:
Equivalence between Two Flowshop Problems - MaxPlus Approach. ICORES 2013: 322-325 - 2012
- [j8]Han Hoogeveen, Christophe Lenté, Vincent T'kindt
Rescheduling for new orders on a single machine with setup times. Eur. J. Oper. Res. 223(1): 40-46 (2012) - 2011
- [j7]Yannick Kergosien
A tabu search heuristic for the dynamic transportation of patients between care units. Eur. J. Oper. Res. 214(2): 442-452 (2011)
2000 – 2009
- 2006
- [j6]Jean-Louis Bouquard, Christophe Lenté:
Two-machine flow shop scheduling problems with minimal and maximal delays. 4OR 4(1): 15-28 (2006) - [j5]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) - [j4]Jean-Louis Bouquard, Christophe Lenté, Jean-Charles Billaut:
Application of an optimization problem in Max-Plus algebra to scheduling problems. Discret. Appl. Math. 154(15): 2064-2079 (2006) - 2005
- [j3]Vincent T'kindt
The e-OCEA project: towards an Internet decision system for scheduling problems. Decis. Support Syst. 40(2): 329-337 (2005) - 2004
- [j2]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) - 2003
- [j1]Christophe Lenté, Jean-Louis Bouquard:
Généralisation Max-Plus des bornes de Lageweg, Lenstra et Rinnooy Kan. RAIRO Oper. Res. 37(4): 273-289 (2003)
1990 – 1999
- 1997
- [c1]Éric Ramat, Gilles Venturini, Christophe Lenté, Mohamed Slimane:
Solving the Multiple Resource Constrained Project Scheduling Problem with a Hybrid Genetic Algorithm. ICGA 1997: 489-496
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-05-19 00:14 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: