Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes (Q1751235): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1803741
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disopt.2017.03.001 / rank
Normal rank
 
Property / author
 
Property / author: Michael Malmros Sørensen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2603934394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398360 / 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: Some new classes of facets for the equicut polytope / 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: Q4198056 / 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: \(b\)-tree facets for the simple graph partitioning polytope / 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: Q3753826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Graph Bisection Cut 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: The equipartition polytope. I: Formulations, dimension and basic facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size-constrained graph partitioning polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node capacitated graph partitioning problem: A computational study / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISOPT.2017.03.001 / rank
 
Normal rank

Latest revision as of 08:15, 11 December 2024

scientific article
Language Label Description Also known as
English
Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references