On games corresponding to sequencing situations with ready times (Q1906283): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / cites work
 
Property / cites work: Q4658190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing and Cooperation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super-modularity: Applications to convex games and to the greedy algorithm for LP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5817870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores of convex games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3921032 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 10:38, 24 May 2024

scientific article
Language Label Description Also known as
English
On games corresponding to sequencing situations with ready times
scientific article

    Statements

    On games corresponding to sequencing situations with ready times (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 February 1996
    0 references
    0 references
    cooperative sequencing games
    0 references
    one-machine sequencing
    0 references
    equal processing times
    0 references