Cooperation in one machine scheduling (Q3142152): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Sequencing games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(\tau\)-value, the core and semiconvex games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost spanning tree games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Totally Balanced Games and Games of Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the core of linear production games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traveling salesman games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The assignment game. I: The core / rank
 
Normal rank
Property / cites work
 
Property / cites work: Game Theory and Cost Allocation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation games: Another class of totally balanced games / rank
 
Normal rank

Latest revision as of 11:39, 22 May 2024

scientific article
Language Label Description Also known as
English
Cooperation in one machine scheduling
scientific article

    Statements

    Cooperation in one machine scheduling (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 December 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    one-machine scheduling
    0 references
    cost allocation
    0 references