default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrédéric Gardi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j12]Bertrand Estellon, Frédéric Gardi:
Car sequencing is NP-hard: a short proof. J. Oper. Res. Soc. 64(10): 1503-1504 (2013)- 2012
- [j11]Thierry Benoist, Frédéric Gardi, Antoine Jeanjean:
Lessons Learned from 15 Years of Operations Research for French TV Channel TF1. Interfaces 42(6): 577-584 (2012) - 2011
- [j10]Thierry Benoist, Bertrand Estellon, Frédéric Gardi, Romain Megel, Karim Nouioua:
LocalSolver 1.x: a black-box local-search solver for 0-1 programming. 4OR 9(3): 299-316 (2011) - [j9]Frédéric Gardi:
On partitioning interval graphs into proper interval subgraphs and related problems. J. Graph Theory 68(1): 38-54 (2011) - [j8]Thierry Benoist, Frédéric Gardi, Antoine Jeanjean, Bertrand Estellon:
Randomized Local Search for Real-Life Inventory Routing. Transp. Sci. 45(3): 381-398 (2011) - [c5]Frédéric Gardi, Karim Nouioua:
Local Search for Mixed-Integer Nonlinear Optimization: A Methodology and an Application. EvoCOP 2011: 167-178 - 2010
- [j7]Frédéric Gardi:
Optimisation de plans de financement immobiliers. RAIRO Oper. Res. 44(3): 207-239 (2010)
2000 – 2009
- 2009
- [j6]Frédéric Gardi:
Mutual exclusion scheduling with interval graphs or related classes, Part I. Discret. Appl. Math. 157(1): 19-35 (2009) - [c4]Bertrand Estellon, Frédéric Gardi, Karim Nouioua:
High-Performance Local Search for Task Scheduling with Human Resource Allocation. SLS 2009: 1-15 - [c3]Thierry Benoist, Bertrand Estellon, Frédéric Gardi, Antoine Jeanjean:
High-Performance Local Search for Solving Real-Life Inventory Routing Problems. SLS 2009: 105-109 - 2008
- [j5]Frédéric Gardi:
Mutual exclusion scheduling with interval graphs or related classes. Part II. Discret. Appl. Math. 156(5): 794-812 (2008) - [j4]Bertrand Estellon, Frédéric Gardi, Karim Nouioua:
Two local search approaches for solving real-life car sequencing problems. Eur. J. Oper. Res. 191(3): 928-944 (2008) - 2007
- [j3]Frédéric Gardi:
The Roberts characterization of proper and unit interval graphs. Discret. Math. 307(22): 2906-2908 (2007) - 2006
- [j2]Frédéric Gardi:
Mutual exclusion scheduling with interval graphs or related classes: Complexity and algorithms. 4OR 4(1): 87-90 (2006) - [j1]Bertrand Estellon, Frédéric Gardi, Karim Nouioua:
Large neighborhood improvements for solving car sequencing problems. RAIRO Oper. Res. 40(4): 355-379 (2006) - 2004
- [c2]Frédéric Gardi:
On Partitioning Interval and Circular-Arc Graphs into Proper Interval Subgraphs with Applications. LATIN 2004: 129-140 - 2003
- [c1]Frédéric Gardi:
Efficient Algorithms for Disjoint Matchings among Intervals and Related Problems. DMTCS 2003: 168-180
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-24 23:15 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:
