Facet-defining inequalities for the simple graph partitioning polytope (Q2467133): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2006.08.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2079197386 / 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: A branch-and-cut algorithm for the equicut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the \(k\)-partition polytope / 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: Clique-Web Facets for Multicut Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets for the cut cone. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets for the cut cone. II: Clique-web inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete p-dispersion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3753826 / 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: 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: Q3972001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Linear Characterizations of Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithm for the Partitioning of Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The clique partitioning problem: Facets and patching facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Clique-Web Facets for Multicut Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(b\)-tree facets for the simple graph partitioning polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new classes of facets for the equicut polytope / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 14:31, 27 June 2024

scientific article
Language Label Description Also known as
English
Facet-defining inequalities for the simple graph partitioning polytope
scientific article

    Statements

    Facet-defining inequalities for the simple graph partitioning polytope (English)
    0 references
    18 January 2008
    0 references
    clustering
    0 references
    facet
    0 references
    graph partitioning
    0 references
    multicut
    0 references
    polyhedral combinatorics
    0 references

    Identifiers