Pages that link to "Item:Q3699730"

The following pages link to Facets of the Bipartite Subgraph Polytope (Q3699730):

Displaying 40 items.

• On the polyhedral structure of uniform cut polytopes (Q401136) (← links)
• Solving VLSI design and DNA sequencing problems using bipartization of graphs (Q429453) (← links)
• Cardinality constrained combinatorial optimization: complexity and polyhedra (Q429646) (← links)
• From equipartition to uniform cut polytopes: extended polyhedral results (Q533779) (← links)
• The max-cut problem on graphs not contractible to \(K_ 5\) (Q593988) (← links)
• Small bipartite subgraph polytopes (Q613319) (← links)
• The inequicut cone (Q688255) (← links)
• The even and odd cut polytopes (Q688256) (← links)
• Pseudo-Boolean optimization (Q697569) (← links)
• On some weakly bipartite graphs (Q800231) (← links)
• Chvátal closures for mixed integer programming problems (Q922950) (← links)
• Finding a maximum-weight induced \(k\)-partite subgraph of an \(i\)-triangulated graph (Q972337) (← links)
• \(K_ i\)-covers. I: Complexity and polytopes (Q1070249) (← links)
• A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound (Q1071037) (← links)
• Maximum bipartite subgraphs of Kneser graphs (Q1121290) (← links)
• The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
• On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
• The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
• Compositions in the bipartite subgraph polytope (Q1199475) (← links)
• Facets for the cut cone. I (Q1199749) (← links)
• Facets for the cut cone. II: Clique-web inequalities (Q1199750) (← links)
• Max-cut in circulant graphs (Q1201272) (← links)
• Role of redundant constraints for improving dual bounds in polynomial optimization problems (Q1288665) (← links)
• Facets of the \(k\)-partition polytope (Q1897366) (← links)
• The minimum chromatic violation problem: a polyhedral approach (Q2184668) (← links)
• On fractional cut covers (Q2312658) (← links)
• The partition problem (Q2366610) (← links)
• Polyhedral results for the bipartite induced subgraph problem (Q2433802) (← links)
• Generating facets for the cut polytope of a graph by triangular elimination (Q2465651) (← links)
• The equipartition polytope. I: Formulations, dimension and basic facets (Q2639779) (← links)
• The equipartition polytope. II: Valid inequalities and facets (Q2639780) (← links)
• A polyhedral study of lifted multicuts (Q2688466) (← links)
• Engineering Branch-and-Cut Algorithms for the Equicut Problem (Q2848989) (← links)
• Fractional covering by cuts (Q3439381) (← links)
• Transitive packing (Q4645940) (← links)
• On the cut polytope (Q4726054) (← links)
• Semidefinite relaxations for partitioning, assignment and ordering problems (Q5917881) (← links)
• Semidefinite relaxations for partitioning, assignment and ordering problems (Q5925162) (← links)
• On the bond polytope (Q6060889) (← links)
• A new global algorithm for max-cut problem with chordal sparsity (Q6103705) (← links)