Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables (Q335322): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / 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: Lifting theorems and facet characterization for a class of clique partitioning inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cut polytope / 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: On the asymmetric representatives formulation for the vertex coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equipartition polytope. I: Formulations, dimension and basic facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear and quadratic programming approaches for the general graph partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulations and valid inequalities of the node capacitated graph partitioning problem / 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: Some simplified NP-complete graph problems / 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: Facets of the clique partitioning polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-cut clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orbitopal fixing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size-constrained graph partitioning polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realignment in the National Football League: Did they do it right? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the partial order polytope of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The clique partitioning problem: Facets and patching facets / rank
 
Normal rank

Latest revision as of 21:20, 12 July 2024

scientific article
Language Label Description Also known as
English
Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables
scientific article

    Statements

    Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables (English)
    0 references
    0 references
    0 references
    0 references
    2 November 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial optimization
    0 references
    polyhedral approach
    0 references
    graph partitioning
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references