Integer and combinatorial optimization
Integer and combinatorial optimization
Graph bipartization and via minimization
SIAM Journal on Discrete Mathematics
Facets of the balanced (acyclic) induced subgraph polytope
Mathematical Programming: Series A and B
Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs
SIAM Journal on Discrete Mathematics
A min-max relation for K3-covers in graphs noncontractible to K5\e
Discrete Applied Mathematics - Special volume on partitioning and decomposition in combinatorial optimization
Wheel inequalities for stable set polytopes
Mathematical Programming: Series A and B
A characterization of weakly bipartite graphs
Journal of Combinatorial Theory Series B
An efficient approach to multilayer layer assignment with an application to via minimization
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph
Discrete Applied Mathematics
Solving VLSI design and DNA sequencing problems using bipartization of graphs
Computational Optimization and Applications
The maximum k-colorable subgraph problem and orbitopes
Discrete Optimization
| Hi-index | 0.00 |
Given a graph G = (V, E) with node weights, the Bipartite Induced Subgraph Problem (BISP) is to find a maximum weight subset of nodes V' of G such that the subgraph induced by V' is bipartite. In this paper we study the facial structure of the polytope associated with that problem. We describe two classes of valid inequalities for this polytope and give necessary and sufficient conditions for these inequalities to be facet defining. For one of these classes, induced by the so-called wheels of order q, we give a polynomial time separation algorithm. We also describe some lifting procedures and discuss separation heuristics. We finally describe a Branch-and-Cut algorithm based on these results and present some computational results.