- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j27 |      | Alain Billionnet, Sourour Elloumi, Amélie Lambert: An efficient compact quadratic convex reformulation for general integer quadratic programs. Comp. Opt. and Appl. 54(1): 141-162 (2013) |
| 2012 | ||
| j26 | | 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 | ||
| j25 | | Alain Billionnet: Optimal selection of forest patches using integer and fractional programming. Operational Research 10(1): 1-26 (2010) |
| 2009 | ||
| j24 | | 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 157(6): 1185-1197 (2009) |
| 2008 | ||
| j23 | | Alain Billionnet, Sourour Elloumi, Marie-Christine Plateau: Quadratic 0-1 programming: Tightening linear or quadratic convex reformulation by use of relaxations. RAIRO - Operations Research 42(2): 103-121 (2008) |
| j22 | | Alain Billionnet: Redundancy Allocation for Series-Parallel Systems Using Integer Linear Programming. IEEE Transactions on Reliability 57(3): 507-516 (2008) |
| c2 | | Alain Billionnet, Sourour Elloumi, Amélie Lambert: Linear Reformulations of Integer Quadratic Programs. MCO 2008: 43-51 |
| 2007 | ||
| j21 | | 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 | ||
| j20 | | Alain Billionnet, Karima Djebali: Solution of a fractional combinatorial optimization problem by mixed integer programming. RAIRO - Operations Research 40(2): 97-111 (2006) |
| 2005 | ||
| j19 | | Alain Billionnet, Sourour Elloumi, Leila Grouz Djerbi: Designing radio-mobile access networks based on synchronous digital hierarchy rings. Computers & OR 32: 379-394 (2005) |
| 2004 | ||
| j18 | | Marie-Christine Costa, Alain Billionnet: Multiway cut and integer flow problems in trees. Electronic Notes in Discrete Mathematics 17: 105-109 (2004) |
| j17 | | Alain Billionnet: Mixed integer programming for the 0-1 maximum probability model. European Journal of Operational Research 156(1): 83-91 (2004) |
| j16 | | Alain Billionnet, Éric Soutif: An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem. European Journal of Operational Research 157(3): 565-575 (2004) |
| j15 | | Alain Billionnet, Éric Soutif: Using a Mixed Integer Programming Tool for Solving the 0-1 Quadratic Knapsack Problem. INFORMS Journal on Computing 16(2): 188-197 (2004) |
| c1 |  | Marie-Christine Costa, Alain Billionnet: Multiway Cut and Integer Flow Problems in Trees. CTW 2004: 96-99 |
| 2003 | ||
| j14 | | Alain Billionnet: Using Integer Programming to Solve the Train-Platforming Problem. Transportation Science 37(2): 213-222 (2003) |
| 2002 | ||
| j13 | | Alain Billionnet: Approximation algorithms for fractional knapsack problems. Oper. Res. Lett. 30(5): 336-342 (2002) |
| 2001 | ||
| j12 | | Alain Billionnet, Sourour Elloumi: Best reduction of the quadratic semi-assignment problem. Discrete Applied Mathematics 109(3): 197-213 (2001) |
| j11 | | 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) |
| 1999 | ||
| j10 | | Alain Billionnet, Alain Faye, Éric Soutif: A new upper bound for the 0-1 quadratic knapsack problem. European Journal of Operational Research 112(3): 664-672 (1999) |
| j9 | | Alain Billionnet: Integer programming to schedule a hierarchical workforce with variable demands. European Journal of Operational Research 114(1): 105-114 (1999) |
| 1997 | ||
| j8 | | Alain Billionnet, Alain Faye: A Lower Bound for a Constrained Quadratic 0-1 Minimization Problem. Discrete Applied Mathematics 74(2): 135-146 (1997) |
| 1995 | ||
| j7 | | Alain Billionnet, Sourour Elloumi: An Algorithm for Finding the K-Best Allocations of a Tree Structured Program. J. Parallel Distrib. Comput. 26(2): 225-232 (1995) |
| 1994 | ||
| j6 | | Alain Billionnet, Marie-Christine Costa: Solving the Uncapacited Plant Location Problem on Trees. Discrete Applied Mathematics 49(1-3): 51-59 (1994) |
| j5 | | Alain Billionnet: Allocating Tree Structured Programs in a Distributed System with Uniform Communication Costs. IEEE Trans. Parallel Distrib. Syst. 5(4): 445-448 (1994) |
| 1993 | ||
| j4 | | Alain Billionnet: Partitioning Multiple-Chain-Like Task Across a Host-Satellite System. Inf. Process. Lett. 48(5): 261-266 (1993) |
| 1992 | ||
| j3 | | Alain Billionnet, Marie-Christine Costa, Alain Sutter: An Efficient Algorithm for a Task Allocation Problem. J. ACM 39(3): 502-518 (1992) |
| j2 | | Alain Billionnet, Alain Sutter: Persistency in quadratic 0-1 optimization. Math. Program. 54: 115-119 (1992) |
| 1990 | ||
| j1 | | Warren E. Adams, Alain Billionnet, Alain Sutter: Unconstrained 0-1 optimization and Lagrangean relaxation. Discrete Applied Mathematics 29(2-3): 131-142 (1990) |
Colors in the list of coauthors
Last update Wed May 22 00:59:53 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page