Improved compact formulations for a wide class of graph partitioning problems in sparse graphs (Q1751240): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SONET/SDH ring assignment with capacity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Solution of a Graph Partitioning Problem under Capacity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet-defining inequalities for the simple graph partitioning polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size-constrained graph partitioning polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node capacitated graph partitioning problem: A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orbitopal fixing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for a clustering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Graph Partitioning Polytope on Series-Parallel and 4-Wheel Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approaches for optimizing over the semimetric polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Partitioning and Graph Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: L’algebre de Boole et ses applications en recherche operationnelle / rank
 
Normal rank

Revision as of 17:08, 15 July 2024

scientific article
Language Label Description Also known as
English
Improved compact formulations for a wide class of graph partitioning problems in sparse graphs
scientific article

    Statements

    Improved compact formulations for a wide class of graph partitioning problems in sparse graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    graph partitioning
    0 references
    triangle inequality
    0 references
    SONET/SDH network design
    0 references
    0 references
    0 references

    Identifiers