Minimizing Setups for Ordered Sets: A Linear Algebraic Approach (Q3665161): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3890731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5646916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Jump Number of Dags and Posets: An Introduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Setups for Cycle-Free Ordered Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Scheduling under Precedence Constraints / rank
 
Normal rank

Latest revision as of 09:48, 14 June 2024

scientific article
Language Label Description Also known as
English
Minimizing Setups for Ordered Sets: A Linear Algebraic Approach
scientific article

    Statements

    Minimizing Setups for Ordered Sets: A Linear Algebraic Approach (English)
    0 references
    0 references
    0 references
    0 references
    1983
    0 references
    0 references
    0 references
    0 references
    0 references
    linear extension
    0 references
    setup number of finite ordered set
    0 references
    incidence matrix
    0 references
    cycle-series-parallel ordered sets
    0 references
    0 references