Connected and alternating vectors: Polyhedra and algorithms (Q3895223): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Heinz Groeflin / rank
Normal rank
 
Property / author
 
Property / author: Thomas M. Liebling / rank
Normal rank
 
Property / author
 
Property / author: Heinz Groeflin / rank
 
Normal rank
Property / author
 
Property / author: Thomas M. Liebling / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and the greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4149476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-blocking polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of max flow—min cut / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:57, 13 June 2024

scientific article
Language Label Description Also known as
English
Connected and alternating vectors: Polyhedra and algorithms
scientific article

    Statements

    Connected and alternating vectors: Polyhedra and algorithms (English)
    0 references
    1981
    0 references
    alternating vectors
    0 references
    polyhedral combinatorics
    0 references
    combinatorial optimization
    0 references
    total dual integrality
    0 references
    connected subgraphs
    0 references
    optimal subtrees
    0 references
    connected vectors
    0 references
    undirected graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers