Solving VLSI design and DNA sequencing problems using bipartization of graphs
type: Item
instance of: scholarly article
title: Solving VLSI design and DNA sequencing problems using bipartization of graphs
zbMATH Open document ID: 1245.90100
author: Pierre Fouilhoux
author: A. R. Mahjoub
published in: Computational Optimization and Applications
publication date: 2012-06-19T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 6048057
zbMATH Keywords: electronics
zbMATH Keywords: genomics
zbMATH Keywords: bipartite induced subgraph problem
zbMATH Keywords: polyhedral approach
zbMATH Keywords: branch-and-cut algorithm
MaRDI profile type: Publication
full work available at URL: s10589-010-9355-1
OpenAlex ID: W2104881193
cites work: Facets of the balanced (acyclic) induced subgraph polytope
cites work: Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs
cites work: Facets of the Bipartite Subgraph Polytope
cites work: An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
cites work: The haplotyping problem: an overview of computational models and solutions
cites work: Wheel inequalities for stable set polytopes
cites work: A graph-theoretic via minimization algorithm for two-layer printed circuit boards
cites work: Graph Bipartization and via minimization
cites work: Compositions in the bipartite subgraph polytope
cites work: Polyhedral results for the bipartite induced subgraph problem
cites work: Routing in VLSI-layout
cites work: Weakly bipartite graphs and the max-cut problem
cites work: A characterization of weakly bipartite graphs
cites work: Q4796705
cites work: Q5687199
cites work: A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
DOI: 10.1007/S10589-010-9355-1
description: scientific article; zbMATH DE number 6048057