-
Combinatorial approaches for segmentingbacterium genomes
Bacterium genome plasticity analysis can efficiently be performed by Long-Range PCR (Polymerase Chain Reaction). The first step requires to split the genome into... -
On the design of networks with unicyclic connected components
In this thesis, we use the polyhedral approach to solve combinatorial problems in telecommunications context. First, we introduce the problem of network design with... -
Strong combination of ant colony optimization with constraint programming opt...
In this thesis, we focused on the implementation of self-adaptive algorithms for solving optimization problems modeled in a Constraint Programming (CP) language. We... -
Semidefinite Relaxations and Lagrangian Duality with Application to Combinato...
We show that it is fruitful to dualize the integrality constraints in a combinatorial optimization problem. First, this reproduces the known SDP relaxations of the... -
Anisotropic diffusion using power watersheds
International audience -
Learning linear classifiers with ternary weights from Metagenomic Data
National audience -
Contribution à la résolution de problèmes d'optimisation combinatoire : métho...
Combinatorial optimization problems are difficult problems whose solution by exact methods can be time consuming or not realistic. The use of heuristics permits one to... -
On Simulated annealing with temperature-dependent energy and temperature-depe...
International audience -
On the use of smoothing to improve the performance of the splitting method
International audience -
A Dynamic Programming Framework for Combinatorial Optimization Problems on Gr...
Some of the ideas presented in this paper were later used by the author for preparing algorithmic tasks for several contests where the author was a member of the scientific... -
Design and optimisation of resources allocation in reconfigurable machining l...
This work concerns the design and the optimization of reconfigurable transfer lines. The principle objective is to design a machining line with less cost while... -
On green routing and scheduling problem
The vehicle routing and scheduling problem has been studied with much interest within the last four decades. In this paper, some of the existing literature dealing... -
Branch and bound algorithm for a transfer line design problem: Stations with ...
International audience -
Calculating safety stocks for assembly systems with random component procurem...
International audience -
Iterative Methods in Combinatorial Optimization
International audience -
Local search and combinatorial optimization: from structural analysis of a pr...
Many problems from combinatorial optimization are NP-hard, so that exact methods remain inefficient to solve them efficiently. However, metaheuristics are... -
Independent sets and coloring in P5-free graphs
The class of P5-free graphs, namely the graphs without induced chains with five vertices, is of particular interest in graph theory. Indeed, it is the smallest class...
