On the dominant of the \(s\)-\(t\)-cut polytope: vertices, facets, and adjacency (Q2638384): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1007/s10107-010-0373-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2098075313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Min-Cut Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cut polyhedron. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Suggested Computation for Maximal Multi-Commodity Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocking and anti-blocking pairs of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedron with all \(s-t\) cuts as vertices, and adjacency of cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank

Latest revision as of 04:49, 3 July 2024

scientific article
Language Label Description Also known as
English
On the dominant of the \(s\)-\(t\)-cut polytope: vertices, facets, and adjacency
scientific article

    Statements

    On the dominant of the \(s\)-\(t\)-cut polytope: vertices, facets, and adjacency (English)
    0 references
    0 references
    0 references
    16 September 2010
    0 references
    flows
    0 references
    cuts
    0 references
    polyhedral combinatorics
    0 references

    Identifiers

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