Solving VLSI design and DNA sequencing problems using bipartization of graphs
Year of publication: |
2012
|
---|---|
Authors: | Fouilhoux, Pierre ; Mahjoub, A. |
Published in: |
Computational Optimization and Applications. - Springer. - Vol. 51.2012, 2, p. 749-781
|
Publisher: |
Springer |
Subject: | Electronics | Genomics | Bipartite induced subgraph problem | Polyhedral approach | Branch-and-cut algorithm |
-
A branch-and-cut for the Non-Disjoint m-Ring-Star problem
Fouilhoux, Pierre, (2014)
-
An exact algorithm for solving the vertex separator problem
Biha, Mohamed Didi, (2011)
-
Two-phase branch-and-cut for the mixed capacitated general routing problem
Irnich, Stefan, (2015)
- More ...
-
Valid inequalities for the synchronization bus timetabling problem
Fouilhoux, Pierre, (2016)
-
A branch-and-cut for the Non-Disjoint m-Ring-Star problem
Fouilhoux, Pierre, (2014)
-
Branch-and-Cut-and-Price algorithms for the preemptive RCPSP
Fouilhoux, Pierre, (2018)
- More ...