From equipartition to uniform cut polytopes: extended polyhedral results (Q533779): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2011.01.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069946405 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Graph Bisection Cut Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the Bipartite Subgraph Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the equicut 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: The equipartition polytope. II: Valid inequalities and facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new classes of facets for the equicut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Via Minimization with Pin Preassignments and Layer Preference / rank
 
Normal rank

Latest revision as of 01:19, 4 July 2024

scientific article
Language Label Description Also known as
English
From equipartition to uniform cut polytopes: extended polyhedral results
scientific article

    Statements

    From equipartition to uniform cut polytopes: extended polyhedral results (English)
    0 references
    0 references
    6 May 2011
    0 references
    0 references
    uniform cut polytopes
    0 references
    graph partitioning
    0 references
    0 references