Skip to Main content
Number of documents

126

Alain Billionnet


Journal articles53 documents

  • Alain Billionnet. Phylogenetic conservation prioritization with uncertainty. Biodiversity and Conservation, Springer Verlag, 2018, 27 (12), pp.3137-3153. ⟨10.1007/s10531-018-1593-z⟩. ⟨hal-02465032⟩
  • Alain Billionnet. Quantifying extinction probabilities of endangered species for phylogenetic conservation prioritization may not be as sensitive as might be feared. Biodiversity and Conservation, Springer Verlag, 2018, 27 (5), pp.1189-1200. ⟨10.1007/s10531-017-1487-5⟩. ⟨hal-02465077⟩
  • Sabine Tréfond, Alain Billionnet, Sourour Elloumi, H. Djellab, Olivier Guyon. Optimization and simulation for robust railway rolling-stock planning. Journal of Rail Transport Planning & Management, 2017, ⟨10.1016/j.jrtpm.2017.02.001⟩. ⟨hal-01497842⟩
  • Alain Billionnet, Sourour Elloumi, Amélie Lambert, Angelika Wiegele. Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation. INFORMS Journal on Computing, Institute for Operations Research and the Management Sciences (INFORMS), 2017, 29 (2), pp.318 - 331. ⟨10.1287/ijoc.2016.0731⟩. ⟨hal-01811329⟩
  • Alain Billionnet, Sourour Elloumi, Amélie Lambert. Exact quadratic convex reformulations of mixed-integer quadratically constrained problems. Mathematical Programming, Springer Verlag, 2016, 158 (1-2), pp.235-266. ⟨10.1007/s10107-015-0921-2⟩. ⟨hal-02922683⟩
  • Alain Billionnet, Marie-Christine Costa, Pierre-Louis Poirion. Robust optimal sizing of a hybrid energy stand-alone system. European Journal of Operational Research, Elsevier, 2016, 254, pp.565 - 575. ⟨10.1016/j.ejor.2016.03.013⟩. ⟨hal-01413112⟩
  • Alain Billionnet. Designing robust nature reserves under uncertain survival probabilities. Environmental Modeling & Assessment, Springer, 2014, pp.available on-line. ⟨hal-01126510⟩
  • Alain Billionnet, Sourour Elloumi, Amélie Lambert. A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation. Journal of Combinatorial Optimization, Springer Verlag, 2014, 28, pp.376-399. ⟨hal-01126210⟩
  • Alain Billionnet, Marie-Christine Costa, Pierre-Louis Poirion. 2-Stage Robust MILP with continuous recourse variables. Discrete Applied Mathematics, Elsevier, 2014, 170, pp.21-32. ⟨10.1016/j.dam.2014.01.017⟩. ⟨hal-00968777⟩
  • Alain Billionnet, Ghassen Tlig, Fethi Jarray, Ezzedine Zagrouba. Reconstructing Convex Matrices by Integer Programming Approaches. Journal of Mathematical Modelling and Algorithms in Operations Research, Springer, 2013, 12, pp.329-343. ⟨hal-01126168⟩
  • Alain Billionnet. Solution of the Generalized Noah's Ark Problem. Systematic biology., 2013, 62, pp.147-156. ⟨hal-01126205⟩
  • Alain Billionnet, Sourour Elloumi, Amélie Lambert. An efficient compact quadratic convex reformulation for general integer quadratic programs. Computational Optimization and Applications, Springer Verlag, 2013, 54, pp.141-162. ⟨hal-01126098⟩
  • Alain Billionnet. Mathematical optimization ideas for biodiversity conservation. European Journal of Operational Research, Elsevier, 2013, 231, pp.514-534. ⟨hal-01126257⟩
  • Alain Billionnet, Sourour Elloumi, Amélie Lambert. Extending the QCR method to the case of general mixed integer programs. Mathematical Programming Computation, Springer, 2012, 131, pp.381-401. ⟨hal-01125718⟩
  • Alain Billionnet. Designing an optimal connected nature reserve. Applied Mathematical Modelling, Elsevier, 2012, 36, pp.2213-2223. ⟨hal-01125965⟩
  • Alain Billionnet. Solving the probabilistic reserve selection problem. Ecological modelling., 2011, 222, pp.546-554. ⟨hal-01125805⟩
  • Alain Billionnet. Optimal selection of forest patches using integer and fractional programming. Operational Research Spectrum, 2010, 10, pp.1-26. ⟨hal-01125721⟩
  • Alain Billionnet. Integer Programming for Optimizing Habitat Network Permeability. Management of Environmental Quality: An International Journal, Emerald, 2010, 21, pp.570-588. ⟨hal-01125722⟩
  • Alain Billionnet. Solving a cut problem in bipartite graphs by linear programming: Application to a forest management problem. Applied Mathematical Modelling, Elsevier, 2010, 34, pp.1042-1050. ⟨hal-01125720⟩
  • 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. Discrete Applied Mathematics, Elsevier, 2009, 157, pp.1185-1197. ⟨hal-01125253⟩
  • Alain Billionnet, Sourour Elloumi, Marie-Christine Plateau. Quadratic 0-1 programming : tightening linear or quadratic convex reformulation by use of relaxations. RAIRO - Operations Research, EDP Sciences, 2008, 42, pp.103-121. ⟨hal-01125219⟩
  • Alain Billionnet. Redundancy Allocation for Series-Parallel Systems Using Integer Linear Programming. IEEE Transactions on Device and Materials Reliability, Institute of Electrical and Electronics Engineers, 2008, 57, pp.507 - 516. ⟨hal-01125392⟩
  • Alain Billionnet, Frédéric Roupin. A Deterministic Approximation Algorithm for the Densest k-Subgraph Problem. International Journal of Operational Research, Inderscience, 2008, 3 (3), pp.301-314. ⟨10.1504/IJOR.2008.017534⟩. ⟨hal-00596169⟩
  • Alain Billionnet, Sourour Elloumi. Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem. Mathematical Programming Computation, Springer, 2007, 109 (1), pp.55-68. ⟨10.1007/s10107-005-0637-9⟩. ⟨hal-01125239⟩
  • Alain Billionnet, Karima Djebali. Solution of a fractional combinatorial optimization problem by mixed integer programming. RAIRO - Operations Research, EDP Sciences, 2006, 40, pp.97-111. ⟨hal-01125487⟩
  • Alain Billionnet. Different formulations for solving the heaviest k-subgraph problem. INFOR, 2005, 43, pp.171-186. ⟨hal-01124973⟩
  • Alain Billionnet, Sourour Elloumi, L. Grouz Djerbi. Designing radio-mobile access networks based on SDH rings. Computers and Operations Research, Elsevier, 2005, 32, pp.379-394. ⟨hal-01124692⟩
  • Alain Billionnet, Eric Soutif. Using a Mixed Integer Programming Tool for Solving the 0-1 Quadratic Knapsack Problem. ISDR Informs Asia & Pacific, 2004, 16, pp.188-197. ⟨hal-01124544⟩
  • Alain Billionnet. Mixed integer programming for the 0-1 maximum probability model. European Journal of Operational Research, Elsevier, 2004, 156, pp.83-91. ⟨hal-01124824⟩
  • Alain Billionnet, Eric Soutif. An exact method based on lagrangian decomposition for the 0-1 quadratic knapsack problem. European Journal of Operational Research, Elsevier, 2004, 157, pp.565-575. ⟨hal-01124918⟩
  • Alain Billionnet. Using Integer Programming to Solve the Train Platforming Problem. Transportation Science, INFORMS, 2003, 37, pp.213-222. ⟨hal-01124706⟩
  • Alain Billionnet. Minimising Total Average Cycle Stock Subject to Practical Constraints. Journal of the Operational Research Society, Palgrave Macmillan, 2003, 54, pp.362-370. ⟨hal-01124794⟩
  • Alain Billionnet. Approximation algorithms for fractional knapsack problems. Operations Research Letters, Elsevier, 2002, 30, pp.336-342. ⟨hal-01124705⟩
  • Alain Billionnet. Approximate and exact solution methods for the hyperbolic 0-1 knapsack problem. INFOR, 2002, 40, pp.97-110. ⟨hal-01124547⟩
  • Xavier Castellani, H. Jiang, Alain Billionnet. Method for the analysis and design of class characteristic migrations during object system evolution. INTELLIGENT INFORMATION SYSTEMS, 2001, 26, pp.237-257. ⟨hal-01124707⟩
  • Alain Billionnet, Sourour Elloumi. Best reduction of the quadratic semi-assignment problem. Discrete Applied Mathematics, Elsevier, 2001, 109, pp.197-213. ⟨hal-01124542⟩
  • Alain Billionnet, Rouquia Djabali, Alain Sutter. Optimisation de réseaux urbains par la PLNE. Revue des Sciences et Technologies de l'Information - Série TSI : Technique et Science Informatiques, Lavoisier, 2000, 19, pp.1127-1150. ⟨hal-01124537⟩
  • Alain Billionnet. Integer programming to schedule a hierarchical workforce with variable demands. European Journal of Operational Research, Elsevier, 1999, 114, pp.105-114. ⟨hal-01124496⟩
  • Alain Billionnet, Alain Faye, Eric Soutif. A new upper bound for the 0-1 quadratic knapsack problem. European Journal of Operational Research, Elsevier, 1999, 112, pp.664-672. ⟨hal-01124497⟩
  • Alain Billionnet, Marie-Christine Costa, Wei-Ying Thang. Le placement de tâches dans la conception et l'utilisation d'une architecture distribuée. Une application à EDF. Revue des Sciences et Technologies de l'Information - Série TSI : Technique et Science Informatiques, Lavoisier, 1998, 17, pp.999-1015. ⟨hal-01124498⟩
  • Alain Billionnet, Alain Faye. A lower bound for a constrained quadratic 0-1 minimization problem. Discrete Applied Mathematics, Elsevier, 1997, 74, pp.135-146. ⟨hal-01124503⟩
  • Alain Billionnet, Frédéric Calmels. Linear programming for the 0-1 quadratic knapsack problem. European Journal of Operational Research, Elsevier, 1996, 92, pp.310-325. ⟨hal-01124499⟩
  • Alain Billionnet, Sourour Elloumi. An algorithm for finding the k-best allocations of a tree-structured program. Journal of Parallel and Distributed Computing, Elsevier, 1995, 26, pp.225-232. ⟨hal-01124500⟩
  • Alain Billionnet, Sourour Elloumi. Placement des tâches d'un programme à structure arborescente sur un réseau de processeurs: synthèse de résultats récents. INFOR, 1994, 32, pp.65-86. ⟨hal-01124501⟩
  • Alain Billionnet. Allocating tree structured programs in a distributed system with uniform communication costs. IEEE Transactions on Parallel and Distributed Systems, Institute of Electrical and Electronics Engineers, 1994, 5, pp.445-448. ⟨hal-01124504⟩
  • Alain Billionnet, Marie-Christine Costa. Solving the uncapacited plant location problem on trees. Discrete Applied Mathematics, Elsevier, 1994, 49, pp.51-59. ⟨hal-01124502⟩
  • Alain Billionnet, Alain Sutter. Minimization of a quadratic pseudo-Boolean function. European Journal of Operational Research, Elsevier, 1994, 78, pp.106-115. ⟨hal-01124495⟩
  • Alain Billionnet. Partitioning multiple chains-like task across a host-satellite system. Information Processing Letters, Elsevier, 1993, 48, pp.261-266. ⟨hal-01124506⟩
  • Alain Billionnet, Alain Sutter. Persistency in quadratic 0-1 optimization. Mathematical Programming Computation, Springer, 1992, 54, pp.115-119. ⟨hal-01124511⟩
  • Alain Billionnet, Alain Sutter. An efficient algorithm for the 3-satisfiability problem. Operations Research Letters, Elsevier, 1992, 12, pp.29-36. ⟨hal-01124507⟩
  • Alain Billionnet, Marie-Christine Costa, Alain Sutter. An efficient algorithm for a task allocation problem. Journal of the ACM (JACM), Association for Computing Machinery, 1992, 39, pp.502-518. ⟨hal-01124505⟩
  • Alain Billionnet, Sourour Elloumi. Placement de tâches dans un système distribué et dualité lagrangienne. RAIRO, EDP sciences, 1992, 26, pp.83-97. ⟨hal-01124510⟩
  • Alain Billionnet. Placement de tâches à structure arborescente avec contraintes de charge. Revue des Sciences et Technologies de l'Information - Série TSI : Technique et Science Informatiques, Lavoisier, 1992, 11, pp.117-137. ⟨hal-01124508⟩

Conference papers55 documents

  • Amélie Lambert, Sourour Elloumi, Alain Billionnet. Global Solution of General Quadratic Programs. ISMP 15, Jul 2015, Pittsburg, United States. ⟨hal-02455441⟩
  • Ghassen Tlig, Alain Billionnet, Ezzedine Zagrouba. Reconstruction de matrices binaires sous contraintes de voisinage. ROADEF, 14? Conf?rence de la Soci?t? Fran?aise de Recherche Op?rationnelle et Aide ? la D?cision, Feb 2013, Troyes, France. pp.140. ⟨hal-01126232⟩
  • Alain Billionnet, Marie-Christine Costa, Pierre-Louis Poirion. Optimisation robuste d?un parc autonome de production d?électricité . ROADEF, 14? Conf?rence de la Soci?t? Fran?aise de Recherche Op?rationnelle et Aide ? la D?cision, Feb 2013, Troyes, France. pp.71. ⟨hal-01126287⟩
  • Sabine Tréfond, Alain Billionnet, Sourour Elloumi, Housni Djellab. Optimisation et simulation pour la planification robuste des roulements d?engins en milieu ferroviaire. ROADEF, 14? Conf?rence de la Soci?t? Fran?aise de Recherche Op?rationnelle et Aide ? la D?cision, Feb 2013, Troyes, France. pp.241. ⟨hal-01126231⟩
  • Alain Billionnet, Marie-Christine Costa, Pierre-Louis Poirion. Programmation linéaire mixte robuste avec variables de recours continues. ROADEF, 14?me Conf?rence de la Soci?t? Fran?aise de Recherche Op?rationnelle et Aide ? la D?cision, Feb 2013, Troyes, France. pp.123. ⟨hal-01126531⟩
  • Alain Billionnet, Housni Djellab, Sourour Elloumi, Sabine Trefond. A column generation based method for robust railway rolling-stock planning. TRISTAN VIII - EIGHTH TRIENNIAL SYMPOSIUM ON TRANSPORTATION ANALYSIS, Jun 2013, San Pedro De Atacama, Chile. ⟨hal-00848288⟩
  • Sabine Trefond, Housni Djellab, Alain Billionnet, Sourour Elloumi. Optimisation et simulation pour la planification robuste des roulements d'engins en milieu ferroviaire. 14è conférence ROADEF de la Société Française de Recherche Opérationnelle et Aide à la Décision, Feb 2013, TROYES, France. ⟨hal-00848279⟩
  • Sourour Elloumi, Alain Billionnet, Amélie Lambert. Global solution of mixed-integer quadratic programs through quadratic convex reformulation. EURO XXVI, Jul 2013, ROME, Italy. pp.91. ⟨hal-01126261⟩
  • Alain Billionnet, Sourour Elloumi, Amélie Lambert. Convex reformulations of mixed-integer quadratically constrained programs. EUROPT 2013, Jun 2013, Florence, Italy. pp.24. ⟨hal-01126271⟩
  • Sabine Trefond, Housni Djellab, Alain Billionnet, Sourour Elloumi, Enzo Escobar. A robust-planning methodology for railway rolling-stock. COMPUTERS IN RAILWAYS XIII, Sep 2012, Lyndhurst, New Forest, United Kingdom. pp.349. ⟨hal-00759943⟩
  • Sabine Trefond, Housni Djellab, Alain Billionnet, Sourour Elloumi. Planification robuste du matériel roulant ferroviaire. Congrès annuel de la Société française de Recherche Opérationnelle et d'Aide à la Décision, Apr 2012, Angers, France. pp.544. ⟨hal-00759950⟩
  • Alain Billionnet, Fethi Jarray, Ghassen Tlig, Ezzedine Zagrouba. Combining simulated annealing and linear programming approaches for reconstructing hv-convex colored images. ISCO 2012 (2nd International Symposium on Combinatorial Optimization), Apr 2012, Athens, Greece. 4 p. ⟨hal-01126052⟩
  • Sabine Tréfond, Housni Djellab, Alain Billionnet, Sourour Elloumi. Planification robuste du matériel roulant ferroviaire. ROADEF 2012, 13?me congr?s annuel de la Soci?t? fran?aise de Recherche Op?rationnelle et d?Aide ? la D?cision, Apr 2012, Angers, France. pp.544--545. ⟨hal-01126076⟩
  • Alain Billionnet, Fethi Jarray, Ghassen Tlig, Ezzedine Zagrouba. Programmation discrète pour la reconstruction de matrices convexes. ROADEF 2012, 13?me Congr?s annuel de la Soci?t? fran?aise de Recherche Op?rationnelle et d?Aide ? la D?cision, Apr 2012, Angers, France. 2 p. ⟨hal-01126109⟩
  • Alain Billionnet, Marie-Christine Costa, Pierre-Louis Poirion. Robust optimal sizing of an hybrid energy stand-alone system . 21st International Symposium on Mathematical Programming (ISMP 2012) and ROADEF 2012, Aug 2012, Berlin, Germany. pp.191. ⟨hal-01126110⟩
  • Alain Billionnet, Sourour Elloumi, Amélie Lambert. Convex reformulations of Integer Quadratically Constrained Problems. ISMP (21th International Symposium of Mathematical programming), Aug 2012, Berlin, Germany. 1 page. ⟨hal-01126039⟩
  • Alain Billionnet, Sourour Elloumi, Amélie Lambert. A new Branch and Bound algorithm for MIQPs. EURO 2012, Jul 2012, Vilnius, Liechtenstein. pp.57. ⟨hal-01126099⟩
  • Alain Billionnet, Marie-Christine Costa, Pierre-Louis Poirion. Optimizing an hybrid energy system. Conference on Optimization and Practices in Industry (COPI'11), Nov 2011, Paris, France. pp.20-22. ⟨hal-01125967⟩
  • Alain Billionnet, Marie-Christine Costa, Pierre-Louis Poirion. Recherche opérationnelle et énergie renouvelable: une présentation de quelques problèmes. ROADEF 2011, 12?me congr?s annuel de la Soci?t? fran?aise de Recherche Op?rationnelle et d?Aide ? la D?cision, Mar 2011, Saint-Etienne, France. pp.145-146. ⟨hal-01125966⟩
  • Alain Billionnet, Sourour Elloumi, Amélie Lambert. A solution method for quadratically constrained integer problems. Optimization 2011, Lisbon, Portugal., Jul 2011, X, France. pp.64. ⟨hal-01125963⟩
  • Alain Billionnet. Recherche opérationnelle et protection de la biodiversité: quelques exemples. CIRO'10, Cinqui?me Conf?rence Internationale en Recherche. Op?rationnelle, May 2010, Marrakech, Morocco. pp.29. ⟨hal-01126042⟩
  • Alain Billionnet, Sourour Elloumi, Amélie Lambert. Reformulation convexe des programmes quadratiques entiers : un algorithme de Branch and Bound fondé sur la structure du problème reformulé. ROADEF 10, 11?me congr?s annuel de la Soci?t? fran?aise de Recherche Op?rationnelle et d?Aide ? la D?cision, Feb 2010, Toulouse, France. 2 p. ⟨hal-01125730⟩
  • Alain Billionnet, Sourour Elloumi, Amélie Lambert. Solving a general mixed-integer quadratic problem through convex reformulation : a computational study. EWMINLP, Apr 2010, Marseille, France. ⟨hal-02455431⟩
  • Alain Billionnet, Sourour Elloumi, Aur?lie Le Ma?tre. Equipment replacement planning in a telecommunication network with a decreasing number of clients. INOC (International Network Optimization Conference), Apr 2009, Pise, Italie. 4 p. ⟨hal-01125637⟩
  • Alain Billionnet, Sourour Elloumi, Amélie Lambert. Convex reformulations for binary quadratic programs. EURO 2009, 23rd European Conference on Operational Research, Jul 2009, Bonn, Germany. pp.47. ⟨hal-01125632⟩
  • Alain Billionnet, Sourour Elloumi, Amélie Lambert. Convex reformulations for integer quadratic programs. 20th International Symposium of Mathematical programming (ISMP), Aug 2009, Chicago, United States. pp.115. ⟨hal-01125634⟩
  • Alain Billionnet, Sourour Elloumi, Amélie Lambert. Résolution de programmes quadratiques en nombres entiers par reformulation convexe. JPOC 6 (Journ?es Poly?dres et Optimisation Combinatoire), Jun 2009, Bordeaux, France. pp.15-18. ⟨hal-01125633⟩
  • Alain Billionnet, Sourour Elloumi, Aur?lie Le Ma?tre. Optimisation robuste d'une migration de matériel dans un réseau en décroissance. ROADEF'08, 9?me Congr?s de la Soci?t? Fran?aise de Recherche Op?rationnelle et d?Aide ? la D?cision, Feb 2008, Clermont-Ferrand, France. pp.69-70. ⟨hal-01125488⟩
  • Alain Billionnet, Sourour Elloumi, Amélie Lambert. Linear Reformulations of Integer Quadratic Programs. MCO'08, 2nd international conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, Sep 2008, Metz, France. pp.43-51. ⟨hal-01125562⟩
  • Alain Billionnet, Sourour Elloumi, Amélie Lambert. Comparaison de reformulations linéaires de programmes quadratiques en nombres entiers. ROADEF'08, 9?me Congr?s de la Soci?t? Fran?aise de Recherche Op?rationnelle et d?Aide ? la D?cision, Feb 2008, Clermont-Ferrand, France. pp.71-72. ⟨hal-01125408⟩
  • Alain Billionnet, Sourour Elloumi, Marie-Christine Plateau. Reformulation d'un programme quadratique avec un objectif déjà convexe : la méthode QCR appliquée à un problème d'investissement. FRANCORO 5 / ROADEF'07, 5?me journ?es francophones de recherche op?rationnelle / 8?me congr?s de la soci?t? fran?aise de recherche op?rationnelle et d'aide ? la d?cision, Feb 2007, Grenoble, France. pp.369-370. ⟨hal-01125254⟩
  • Alain Billionnet, Laurence Carme, Sourour Elloumi, Aur?lie Le Ma?tre. Etude d'un problème réel de migration de matériel dans un réseau avec décroissance des clients. FRANCORO 5 / ROADEF'07, 5?me journ?es francophones de recherche op?rationnelle / 8?me congr?s de la soci?t? fran?aise de recherche op?rationnelle et d'aide ? la d?cision, Feb 2007, Grenoble, France. pp.95-96. ⟨hal-01125299⟩
  • Alain Billionnet, Sourour Elloumi. Planification d'une migration de réseau dans un réseau en décroissance. Journ?e Optimisation dans les r?seaux ? Gaz-de-France, Saint-Denis., Jan 2007, X, France. ⟨hal-01125420⟩
  • Alain Billionnet, Karima Djebali. Integer linear programming for the robust shortest path problem. MOSIM'06, 6ème Conférence Francophone de Modélisation et Simulation Rabat, Jan 2006, X, France. pp.7. ⟨hal-01125150⟩
  • Sylvain Le Nestour, S. Chapuis, Alain Billionnet, Alain Faye. Applications de la génération de colonnes à un problème de rotations d'équipages. ROADEF'06 7ème congrès, Lille, février, Feb 2006, X, France. pp.38. ⟨hal-01125649⟩
  • Alain Billionnet, Sourour Elloumi, Marie-Christine Plateau. Programmation Quadratique en Variables 0-1 avec Contraintes Linéaires. ROADEF'06 7ème congrès, Lille, février, Feb 2006, X, France. pp.32. ⟨hal-01125158⟩
  • Alain Billionnet, Sourour Elloumi, Aur?lie Le Ma?tre. Equipments replacement planning in a telecommunications network. SODA'06: Seminar on Optimization and Decision Aid, Sophia-antipolis, Jan 2006, X, France. ⟨hal-01125220⟩
  • Karima Djebali, Alain Billionnet. Résolution du problème de p-dispersion par programmation linéaire en nombres entiers et recherche de cliques. ROADEF'05 6ème congrès, Tours, février, Feb 2005, X, France. pp.159-160. ⟨hal-01124974⟩
  • Marie-Christine Plateau, Alain Billionnet, Sourour Elloumi. Eigenvalue Methods for Linearly Constrained Quadratic 0-1 Problems with Application to the Densest k-Subgraph Problem. ROADEF 05, février, Tours, Jan 2005, X, France. pp.55-66. ⟨hal-01125062⟩
  • Alain Billionnet, Sourour Elloumi, Marie-Christine Plateau. Convex Quadratic Reformulation Applied to the Graph Equicut Problem. ALIO/EURO'05 5th Conf. on Combinatorial Optimization, ENST, Paris, France, Jan 2005, X, France. ⟨hal-01125126⟩
  • Alain Billionnet. Résolution de programmes non linéaires en variables 0-1 par la programmation linéaire et la programmation quadratique convexe. CIRO'05, Marrakech, Jan 2005, X, France. pp.16. ⟨hal-01125656⟩
  • Alain Billionnet, Karima Djebali. Maximisation sans contraintes de la somme de plusieurs ratios hyperboliques en 0-1. ROADEF 2003, Avignon, 26-28 février, Jan 2003, X, France. ⟨hal-01124780⟩
  • Alain Billionnet, Sourour Elloumi. Relaxation convexe pour la minimisation d'une fonction quadratique en variables 0-1. 5ème congrès de la ROADEF, Avignon, 26-28 février, Jan 2003, X, France. ⟨hal-01124777⟩
  • Alain Billionnet. Schémas d'approximation pour les problèmes fractionnaires. ROADEF 2003, Avignon, 26-28 février 2003, Jan 2003, X, France. ⟨hal-01124779⟩
  • Alain Billionnet, Karima Djebali. Résolution d'un problème combinatoire fractionnaire par la programmation linéaire mixte. Majecstic'03, Marseille, France, Jan 2003, X, France. ⟨hal-01124817⟩
  • Alain Billionnet, Karima Djebali. Construction de la frontière d'efficience pour un problème de portefeuille non convexe. ROADEF, Paris, Jan 2002, X, France. ⟨hal-01124711⟩
  • Alain Billionnet, Sourour Elloumi, L. Grouz Djerbi. A decomposition method for designing radio-mobile access networks based on SDH rings.. EURO 2001, Rotterdam, Jan 2001, X, France. ⟨hal-01124778⟩
  • Alain Billionnet. Résolution d'un programme stochastique par la programmation linéaire mixte. FRANCORO III, Québec, Jan 2001, X, France. ⟨hal-01124665⟩
  • Alain Billionnet, Frédéric Roupin. Résolution approchée du problème k-cluster. Troisième congrès ROADEF, Nantes, Jan 2000, X, France. ⟨hal-01124545⟩
  • L. Grouz Djerbi, Alain Billionnet, Sourour Elloumi. Designing radio-mobile access networks based on SDH rings. CO 2000, London, Jan 2000, X, France. ⟨hal-01124546⟩
  • L. Grouz Djerbi, Alain Billionnet, Sourour Elloumi. Designing radio-mobile access networks based on SDH ring structures. DRCN2000,Munich, Jan 2000, X, France. ⟨hal-01124612⟩
  • Alain Billionnet, Eric Soutif. Résolution du problème de sac-à-dos quadratique en 0-1. Deuxième congrès ROADEF, Autrans, Jan 1999, X, France. ⟨hal-01124543⟩
  • Alain Billionnet, Rouquia Djabali, Alain Faye. Bornes inférieures pour le problème de la bipartition d'un graphe. Francoro II, Sousse, Tunisie, Jan 1998, X, France. ⟨hal-01124600⟩
  • Alain Billionnet, Rouquia Djabali, Alain Faye. Lower bounds for a constrained quadratic 0-1 problem. EURO 16, Bruxelles, Jan 1998, X, France. ⟨hal-01124601⟩
  • Alain Billionnet, Frédéric Roupin. Linear Programming to approximate quadratic 0-1 maximization problems. 35th Southeast ACM conference, Murfreesboro, USA, Jan 1997, X, France. ⟨hal-01124512⟩

Poster communications1 document

  • Alain Billionnet, Sourour Elloumi, Amélie Lambert. Solving a general mixed-integer quadratic problem through convex reformulation : a computational study . European Workshop on Mixed Integer Nonlinear Programming, Apr 2010, X, Morocco. pp.197-204, 2010. ⟨hal-01126137⟩

Books1 document

  • Alain Billionnet. Optimisation Discrète, de la modélisation à la résolution par des logiciels de programmation mathématique. Dunod. 446 p., 2007, 978-2-10-049687-7. ⟨hal-01125300⟩

Book sections2 documents

  • Alain Billionnet. 0-1 quadratic optimization (traduction anglaise de [Bil05a]). Edited by V. Th. Paschos, Wiley-ISTE. Concepts of Combinatorial Optimization, pp.189-233, ch. 8, 2010, 9781848211476. ⟨hal-01126046⟩
  • Alain Billionnet. Optimisation quadratique en variables 0-1. Hermes-Lavoisier. Optimisation combinatoire 1, concepts fondamentaux, pp.191-236, ch. 7, 2005, 274621038X. ⟨hal-01124976⟩

Other publications1 document

  • Alain Billionnet. Puzzle Game about Connectivity and Biological Corridors. 2017. ⟨hal-02470092⟩

Reports13 documents

  • Alain Billionnet, Marie-Christine Costa, Pierre-Louis Poirion. Robust optimal sizing of an hybrid energy stand-alone system. [Research Report] CEDRIC-13-2899, CEDRIC Lab/CNAM. 2013. ⟨hal-01126344⟩
  • Alain Billionnet, Karima Djebali. Heuristic for finding the efficient frontier in cardinality constrained portfolio optimisation. [Research Report] CEDRIC-07-1743, CEDRIC Lab/CNAM. 2007. ⟨hal-01125651⟩
  • Alain Billionnet, Karima Djebali. An exact algorithm for the p-dispersion problem. [Research Report] CEDRIC-07-1127, CEDRIC Lab/CNAM. 2007. ⟨hal-01125259⟩
  • Alain Billionnet, Sourour Elloumi, Marie-Christine Plateau. Quadratic Convex Reformulation : a Computational Study of the Graph Bisection Problem. [Research Report] CEDRIC-06-1003, CEDRIC Lab/CNAM. 2006. ⟨hal-01125166⟩
  • Alain Billionnet, Sourour Elloumi, Marie-Christine Plateau. Convex Quadratic Programming for Exact Solution of 0-1 Quadratic Programs. [Research Report] CEDRIC-05-856, CEDRIC Lab/CNAM. 2005. ⟨hal-01125063⟩
  • Alain Billionnet. Quadratic 0-1 bibliography. [Research Report] CEDRIC-03-611, CEDRIC Lab/CNAM. 2003. ⟨hal-01124894⟩
  • Alain Billionnet, Sourour Elloumi. Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem. [Research Report] CEDRIC-03-466, CEDRIC Lab/CNAM. 2003. ⟨hal-01124790⟩
  • Alain Billionnet. Mixed Integer Linear Programming for Mixed Integer Quadratic Programming. [Research Report] CEDRIC-03-515, CEDRIC Lab/CNAM. 2003. ⟨hal-01124826⟩
  • Alain Billionnet, Karima Djebali. Integer Linear Programming for the Robust Shortest Path Problem. [Research Report] CEDRIC-02-345, CEDRIC Lab/CNAM. 2002. ⟨hal-01124708⟩
  • Alain Billionnet. Different formulations for the heaviest k-subgraph problem. [Research Report] CEDRIC-02-384, CEDRIC Lab/CNAM. 2002. ⟨hal-01124734⟩
  • Alain Billionnet. Computational experience with a 1/2-approximation algorithm for the hyperbolic 0-1 knapsack problem. [Research Report] CEDRIC-00-105, CEDRIC Lab/CNAM. 2000. ⟨hal-01124530⟩
  • Alain Billionnet, Sourour Elloumi, Alain Faye. The Quadratic Assignment Polytope. [Research Report] CEDRIC-97-381, CEDRIC Lab/CNAM. 1997. ⟨hal-01124732⟩
  • Alain Billionnet, Sourour Elloumi. A new lower bound for the minimization of a constrained non-linear pseudo-Boolean function. [Research Report] CEDRIC-95-324, CEDRIC Lab/CNAM. 1995. ⟨hal-01124691⟩