Polyhedral results for the bipartite induced subgraph problem (Q2433802): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Ali Ridha Mahjoub / rank
Normal rank
 
Property / author
 
Property / author: Ali Ridha Mahjoub / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ABACUS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048660463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the Bipartite Subgraph Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the balanced (acyclic) induced subgraph polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph-theoretic via minimization algorithm for two-layer printed circuit boards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wheel inequalities for stable set polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Bipartization and via minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving VLSI design and DNA sequencing problems using bipartization of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly bipartite graphs and the max-cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of weakly bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A min-max relation for \(K_ 3\)-covers in graphs noncontractible to \(K_ 5\backslash e\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:28, 24 June 2024

scientific article
Language Label Description Also known as
English
Polyhedral results for the bipartite induced subgraph problem
scientific article

    Statements

    Polyhedral results for the bipartite induced subgraph problem (English)
    0 references
    0 references
    0 references
    30 October 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    bipartite induced subgraph
    0 references
    polytope
    0 references
    cut
    0 references
    separation algorithm
    0 references
    facet
    0 references
    lifting
    0 references
    branch-and-cut
    0 references
    0 references