default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlain Faye
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j12]Alain Faye:
A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes. Eur. J. Oper. Res. 270(3): 1148-1157 (2018)- [j11]Dimitri Watel, Alain Faye:
Taxi-sharing: Parameterized complexity and approximability of the dial-a-ride problem with money as an incentive. Theor. Comput. Sci. 745: 202-223 (2018) - 2015
- [j10]Alain Faye:
Solving the Aircraft Landing Problem with time discretization approach. Eur. J. Oper. Res. 242(3): 1028-1038 (2015) - 2013
- [j9]Cédric Hervet, Alain Faye, Marie-Christine Costa, Matthieu Chardy, Stanislas Francfort:
Solving the Two-Stage Robust FTTH network design Problem under Demand Uncertainty. Electron. Notes Discret. Math. 41: 335-342 (2013) - 2012
- [j8]Matthieu Chardy, Marie-Christine Costa, Alain Faye, M. Trampont:
Optimizing splitter and fiber location in a multilevel optical FTTH network. Eur. J. Oper. Res. 222(3): 430-440 (2012) - 2011
- [j7]M. Trampont, C. Destré, Alain Faye:
Solving a continuous local access network design problem with a stabilized central column generation approach. Eur. J. Oper. Res. 214(3): 546-558 (2011)
2000 – 2009
- 2007
- [j6]Alain Faye, Frédéric Roupin:
Partial Lagrangian relaxation for general quadratic programming. 4OR 5(1): 75-88 (2007) - 2005
- [j5]Alain Faye, Quoc-an Trinh:
A polyhedral approach for a constrained quadratic 0-1 problem. Discret. Appl. Math. 149(1-3): 87-100 (2005) - [c1]Alain Faye, Frédéric Roupin:
A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem. ESA 2005: 850-861 - 2003
- [j4]Alain Faye, Olivier Boyer:
Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1. RAIRO Oper. Res. 37(4): 249-271 (2003) - 2000
- [j3]Sourour Elloumi, Alain Faye, Éric Soutif:
Decomposition and Linearization for 0-1 Quadratic Programming. Ann. Oper. Res. 99(1-4): 79-93 (2000)
1990 – 1999
- 1999
- [j2]Alain Billionnet, Alain Faye, Éric Soutif:
A new upper bound for the 0-1 quadratic knapsack problem. Eur. J. Oper. Res. 112(3): 664-672 (1999) - 1997
- [j1]Alain Billionnet, Alain Faye:
A Lower Bound for a Constrained Quadratic 0-1 Minimization Problem. Discret. Appl. Math. 74(2): 135-146 (1997)
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:54 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:
