Billionnet Alain

Alain Billionnet

Information about the author Alain Billionnet will soon be added to the site.
Found 22 papers in total
Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation
Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation
2017
We present algorithm MIQCR‐CB that is an advancement of MIQCR. MIQCR is a...
Reconstructing Convex Matrices by Integer Programming Approaches
Reconstructing Convex Matrices by Integer Programming Approaches
2013
We consider the problem of reconstructing two‐dimensional convex binary...
An efficient compact quadratic convex reformulation for general integer quadratic programs
An efficient compact quadratic convex reformulation for general integer quadratic programs
2013
We address the exact solution of general integer quadratic programs with linear...
Optimal selection of forest patches using integer and fractional programming
Optimal selection of forest patches using integer and fractional programming
2010
Forest fragmentation occurs when large and continuous forests are divided into smaller...
Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
2008
Many combinatorial optimization problems can be formulated as the minimization of a...
A deterministic approximation algorithm for the Densest k-Subgraph Problem
A deterministic approximation algorithm for the Densest k-Subgraph Problem
2008
In the Densest k-Subgraph Problem (DSP), we are given an undirected weighted graph...
Solution of a fractional combinatorial optimization problem by mixed integer programming
Solution of a fractional combinatorial optimization problem by mixed integer programming
2006
Fractional mathematical programs appear in numerous operations research, computer...
Using a mixed integer programming tool for solving the 0–1 quadratic knapsack problem
Using a mixed integer programming tool for solving the 0–1 quadratic knapsack problem
2004
In this paper we will consider the 0–1 quadratic knapsack problem (QKP). Our...
Different formulations for solving the heaviest k-subgraph problem
Different formulations for solving the heaviest k-subgraph problem
2005
We consider the heaviest k-subgraph problem (HSP), i.e. determine a block of k nodes...
Using integer programming to solve the train-platforming problem
Using integer programming to solve the train-platforming problem
2003
We consider the problem of assigning trains to the available tracks at a railway...
Mixed integer programming for the 0–1 maximum probability model
Mixed integer programming for the 0–1 maximum probability model
2004
In this paper we study the 0–1 maximum probability model that consists in...
An exact method based on Lagrangian decomposition for the 0–1 quadratic knapsack problem
An exact method based on Lagrangian decomposition for the 0–1 quadratic knapsack problem
2004
The 0–1 quadratic knapsack problem (QKP) consists in maximizing a quadratic...
Designing radio-mobile access networks based on synchronous digital hierarchy rings
Designing radio-mobile access networks based on synchronous digital hierarchy rings
2005
In this paper, we address the SDH network design problem (SDHNDP) which arises while...
Approximation algorithms for fractional knapsack problems
Approximation algorithms for fractional knapsack problems
2002
We consider the combinatorial optimization problem where the objective function is the...
A new upper bound for the 0–1 quadratic knapsack problem
A new upper bound for the 0–1 quadratic knapsack problem
1999
The 0–1 quadratic knapsack problem (QKP) consists in maximizing a positive...
Integer programming to schedule a hierarchical workforce with variable demands
Integer programming to schedule a hierarchical workforce with variable demands
1999
We consider a hierarchical workforce in which a higher qualified worker can substitute...
Linear programming for the 0–1 quadratic knapsack problem
Linear programming for the 0–1 quadratic knapsack problem
1996
In this paper we consider the quadratic knapsack problem which consists in maximizing...
Assigning the tasks of a tree-like program to a computer network: A survey of recent works
Assigning the tasks of a tree-like program to a computer network: A survey of recent works
1994
The authors consider a set of n processors p 1 ,p 2 ,...,p n which communicate via a...
Persistency in quadratic 0-1 optimization
Persistency in quadratic 0-1 optimization
1992
This paper is concerned with persistency properties which allow the evaluation of some...
An efficient algorithm for the 3-satisfiability problem
An efficient algorithm for the 3-satisfiability problem
1992
Among many different ways, the satisfiability problem (SAT) can be stated as the...
A comparison of three algorithms for reducing the profile of a sparse matrix
A comparison of three algorithms for reducing the profile of a sparse matrix
1989
First a variant of a well-known algorithm, the Levy algorithm, is described. Then a...
A decomposition method for minimizing quadratic pseudo-Boolean functions
A decomposition method for minimizing quadratic pseudo-Boolean functions
1989
A decomposition method is proposed for minimizing quadratic pseudo-Boolean functions....
Papers per page: