A new LP-based lower bound for the cumulative scheduling problem (Q1590042): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 03:17, 1 February 2024

scientific article
Language Label Description Also known as
English
A new LP-based lower bound for the cumulative scheduling problem
scientific article

    Statements

    A new LP-based lower bound for the cumulative scheduling problem (English)
    0 references
    0 references
    0 references
    19 December 2000
    0 references
    0 references
    linear programming
    0 references
    resource constraints
    0 references