| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Alain Billionnet, Sourour Elloumi, Amélie Lambert |
Extending the QCR method to general mixed-integer programs.  |
Math. Program.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Alain Billionnet |
Optimal selection of forest patches using integer and fractional programming. |
Operational Research |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Alain Billionnet |
Redundancy Allocation for Series-Parallel Systems Using Integer Linear Programming. |
IEEE Transactions on Reliability |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Alain Billionnet, Sourour Elloumi, Marie-Christine Plateau |
Quadratic 0-1 programming: Tightening linear or quadratic convex reformulation by use of relaxations. |
RAIRO - Operations Research |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Alain Billionnet, Sourour Elloumi, Amélie Lambert |
Linear Reformulations of Integer Quadratic Programs. |
MCO |
2008 |
DBLP DOI BibTeX RDF |
linear reformulations, Integer programming, quadratic programming |
| 1 | Alain Billionnet, Sourour Elloumi |
Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem. |
Math. Program. |
2007 |
DBLP DOI BibTeX RDF |
Quadratic 0-1 optimization, Convex quadratic relaxation, Semidefinite positive relaxation, Experiments, Integer programming, Max-cut |
| 1 | Alain Billionnet, Karima Djebali |
Solution of a fractional combinatorial optimization problem by mixed integer programming. |
RAIRO - Operations Research |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Alain Billionnet, Sourour Elloumi, Leila Grouz Djerbi |
Designing radio-mobile access networks based on synchronous digital hierarchy rings. |
Computers & OR |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Marie-Christine Costa, Alain Billionnet |
Multiway cut and integer flow problems in trees. |
Electronic Notes in Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Alain Billionnet, Éric Soutif |
An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem. |
European Journal of Operational Research |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Alain Billionnet |
Mixed integer programming for the 0-1 maximum probability model. |
European Journal of Operational Research |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Alain Billionnet, Éric Soutif |
Using a Mixed Integer Programming Tool for Solving the 0-1 Quadratic Knapsack Problem. |
INFORMS Journal on Computing |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Marie-Christine Costa, Alain Billionnet |
Multiway Cut and Integer Flow Problems in Trees. |
CTW |
2004 |
DBLP BibTeX RDF |
|
| 1 | Alain Billionnet |
Using Integer Programming to Solve the Train-Platforming Problem. |
Transportation Science |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Alain Billionnet |
Approximation algorithms for fractional knapsack problems. |
Oper. Res. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Xavier Castellani, Hong Jiang, Alain Billionnet |
Method for the analysis and design of class characteristic migrations during object system evolution. |
Inf. Syst. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Alain Billionnet, Sourour Elloumi |
Best reduction of the quadratic semi-assignment problem. |
Discrete Applied Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Alain Billionnet, Alain Faye, Éric Soutif |
A new upper bound for the 0-1 quadratic knapsack problem. |
European Journal of Operational Research |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Alain Billionnet |
Integer programming to schedule a hierarchical workforce with variable demands. |
European Journal of Operational Research |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Alain Billionnet, Alain Faye |
A Lower Bound for a Constrained Quadratic 0-1 Minimization Problem. |
Discrete Applied Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Alain Billionnet, Sourour Elloumi |
An Algorithm for Finding the K-Best Allocations of a Tree Structured Program. |
J. Parallel Distrib. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Alain Billionnet |
Allocating Tree Structured Programs in a Distributed System with Uniform Communication Costs. |
IEEE Trans. Parallel Distrib. Syst. |
1994 |
DBLP DOI BibTeX RDF |
tree structured programs, optimization, distributed system, computational complexity, complexity, parallel programming, resource allocation, distributed processing, computer network, task allocation, communication costs, tree data structures, communication graph |
| 1 | Alain Billionnet, Marie-Christine Costa |
Solving the Uncapacited Plant Location Problem on Trees. |
Discrete Applied Mathematics |
1994 |
DBLP BibTeX RDF |
|
| 1 | Alain Billionnet |
Partitioning Multiple-Chain-Like Task Across a Host-Satellite System. |
Inf. Process. Lett. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Alain Billionnet, Marie-Christine Costa, Alain Sutter |
An Efficient Algorithm for a Task Allocation Problem. |
J. ACM |
1992 |
DBLP DOI BibTeX RDF |
quadratic 0-1 optimization, task allocation, interprocessor communication, branch-and-bound algorithm, Lagrangean relaxation |
| 1 | Alain Billionnet, Alain Sutter |
Persistency in quadratic 0-1 optimization. |
Math. Program. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Warren E. Adams, Alain Billionnet, Alain Sutter |
Unconstrained 0-1 optimization and Lagrangean relaxation. |
Discrete Applied Mathematics |
1990 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")