default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlain Billionnet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j39]Alain Billionnet, Sourour Elloumi, Amélie Lambert, Angelika Wiegele
:
Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation. INFORMS J. Comput. 29(2): 318-331 (2017)- [j38]Sabine Tréfond, Alain Billionnet, Sourour Elloumi, Housni Djellab, O. Guyon:
Optimization and simulation for robust railway rolling-stock planning. J. Rail Transp. Plan. Manag. 7(1-2): 33-49 (2017) - 2016
- [j37]Alain Billionnet, Marie-Christine Costa, Pierre-Louis Poirion:
Robust optimal sizing of a hybrid energy stand-alone system. Eur. J. Oper. Res. 254(2): 565-575 (2016) - [j36]Alain Billionnet, Sourour Elloumi, Amélie Lambert:
Exact quadratic convex reformulations of mixed-integer quadratically constrained problems. Math. Program. 158(1-2): 235-266 (2016) - 2015
- [c6]Alain Billionnet, Fethi Jarray, Ghassen Tlig, Ezzeddine Zagrouba:
A Tabu Approach for Reconstructing Non-Interior Holes Binary Images. IWCIA (Special Track on Applications) 2015: 31-38 - [c5]Alain Billionnet, Fethi Jarray, Ghassen Tlig, Ezzeddine Zagrouba:
Reconstruction of Bicolored Images. IWCIA 2015: 276-283 - [c4]Alain Billionnet, Sourour Elloumi, Aurélie Le Maître:
Optimal Migration Planning of Telecommunication Equipment. MCO (1) 2015: 69-80 - 2014
- [j35]Alain Billionnet, Marie-Christine Costa, Pierre-Louis Poirion:
2-stage robust MILP with continuous recourse variables. Discret. Appl. Math. 170: 21-32 (2014) - [j34]Alain Billionnet, Sourour Elloumi, Amélie Lambert:
A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation. J. Comb. Optim. 28(2): 376-399 (2014) - 2013
- [j33]Alain Billionnet, Sourour Elloumi, Amélie Lambert:
An efficient compact quadratic convex reformulation for general integer quadratic programs. Comput. Optim. Appl. 54(1): 141-162 (2013) - [j32]Alain Billionnet:
Mathematical optimization ideas for biodiversity conservation. Eur. J. Oper. Res. 231(3): 514-534 (2013) - [j31]Alain Billionnet, Fethi Jarray, Ghassen Tlig, Ezzeddine Zagrouba:
Reconstructing Convex Matrices by Integer Programming Approaches. J. Math. Model. Algorithms Oper. Res. 12(4): 329-343 (2013) - 2012
- [j30]Alain Billionnet, Sourour Elloumi, Amélie Lambert:
Extending the QCR method to general mixed-integer programs. Math. Program. 131(1-2): 381-401 (2012) - 2010
- [j29]Alain Billionnet:
Optimal selection of forest patches using integer and fractional programming. Oper. Res. 10(1): 1-26 (2010)
2000 – 2009
- 2009
- [j28]Alain Billionnet, Sourour Elloumi, Marie-Christine Plateau:
Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method. Discret. Appl. Math. 157(6): 1185-1197 (2009) - 2008
- [j27]Alain Billionnet, Sourour Elloumi, Marie-Christine Plateau:
Quadratic 0-1 programming: Tightening linear or quadratic convex reformulation by use of relaxations. RAIRO Oper. Res. 42(2): 103-121 (2008) - [j26]Alain Billionnet:
Redundancy Allocation for Series-Parallel Systems Using Integer Linear Programming. IEEE Trans. Reliab. 57(3): 507-516 (2008) - [c3]Alain Billionnet, Sourour Elloumi, Amélie Lambert:
Linear Reformulations of Integer Quadratic Programs. MCO 2008: 43-51 - 2007
- [j25]Alain Billionnet, Sourour Elloumi:
Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem. Math. Program. 109(1): 55-68 (2007) - 2006
- [j24]Alain Billionnet, Karima Djebali:
Solution of a fractional combinatorial optimization problem by mixed integer programming. RAIRO Oper. Res. 40(2): 97-111 (2006) - 2005
- [j23]Alain Billionnet, Sourour Elloumi, Leila Grouz Djerbi:
Designing radio-mobile access networks based on synchronous digital hierarchy rings. Comput. Oper. Res. 32: 379-394 (2005) - 2004
- [j22]Marie-Christine Costa, Alain Billionnet:
Multiway cut and integer flow problems in trees. Electron. Notes Discret. Math. 17: 105-109 (2004) - [j21]Alain Billionnet:
Mixed integer programming for the 0-1 maximum probability model. Eur. J. Oper. Res. 156(1): 83-91 (2004) - [j20]Alain Billionnet, Éric Soutif:
An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem. Eur. J. Oper. Res. 157(3): 565-575 (2004) - [j19]Alain Billionnet, Éric Soutif:
Using a Mixed Integer Programming Tool for Solving the 0-1 Quadratic Knapsack Problem. INFORMS J. Comput. 16(2): 188-197 (2004) - [c2]Marie-Christine Costa, Alain Billionnet:
Multiway Cut and Integer Flow Problems in Trees. CTW 2004: 96-99 - 2003
- [j18]Alain Billionnet:
Minimising total average cycle stock subject to practical constraints. J. Oper. Res. Soc. 54(4): 362-370 (2003) - [j17]Alain Billionnet:
Using Integer Programming to Solve the Train-Platforming Problem. Transp. Sci. 37(2): 213-222 (2003) - 2002
- [j16]Alain Billionnet:
Approximation algorithms for fractional knapsack problems. Oper. Res. Lett. 30(5): 336-342 (2002) - 2001
- [j15]Alain Billionnet, Sourour Elloumi:
Best reduction of the quadratic semi-assignment problem. Discret. Appl. Math. 109(3): 197-213 (2001) - [j14]Xavier Castellani, Hong Jiang, Alain Billionnet:
Method for the analysis and design of class characteristic migrations during object system evolution. Inf. Syst. 26(4): 237-257 (2001)
1990 – 1999
- 1999
- [j13]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) - [j12]Alain Billionnet:
Integer programming to schedule a hierarchical workforce with variable demands. Eur. J. Oper. Res. 114(1): 105-114 (1999) - 1997
- [j11]Alain Billionnet, Alain Faye:
A Lower Bound for a Constrained Quadratic 0-1 Minimization Problem. Discret. Appl. Math. 74(2): 135-146 (1997) - [c1]Alain Billionnet, Frédéric Roupin:
Linear programming to approximate quadratic 0-1 maximization problems. ACM Southeast Regional Conference 1997: 171-173 - 1995
- [j10]Alain Billionnet, Sourour Elloumi:
An Algorithm for Finding the K-Best Allocations of a Tree Structured Program. J. Parallel Distributed Comput. 26(2): 225-232 (1995) - 1994
- [j9]Alain Billionnet, Marie-Christine Costa:
Solving the Uncapacited Plant Location Problem on Trees. Discret. Appl. Math. 49(1-3): 51-59 (1994) - [j8]Alain Billionnet:
Allocating Tree Structured Programs in a Distributed System with Uniform Communication Costs. IEEE Trans. Parallel Distributed Syst. 5(4): 445-448 (1994) - 1993
- [j7]Alain Billionnet:
Partitioning Multiple-Chain-Like Task Across a Host-Satellite System. Inf. Process. Lett. 48(5): 261-266 (1993) - 1992
- [j6]Alain Billionnet, Marie-Christine Costa, Alain Sutter:
An Efficient Algorithm for a Task Allocation Problem. J. ACM 39(3): 502-518 (1992) - [j5]Alain Billionnet, Alain Sutter:
Persistency in quadratic 0-1 optimization. Math. Program. 54: 115-119 (1992) - [j4]Alain Billionnet, Alain Sutter:
An efficient algorithm for the 3-satisfiability problem. Oper. Res. Lett. 12(1): 29-36 (1992) - 1990
- [j3]Warren E. Adams, Alain Billionnet, Alain Sutter:
Unconstrained 0-1 optimization and Lagrangean relaxation. Discret. Appl. Math. 29(2-3): 131-142 (1990)
1980 – 1989
- 1985
- [j2]Alain Billionnet, Michel Minoux:
Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions. Discret. Appl. Math. 12(1): 1-11 (1985) - 1981
- [j1]Alain Billionnet:
An upper bound on the size of the largest cliques in a graph. J. Graph Theory 5(2): 165-169 (1981)
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:
