Shortest common superstrings and scheduling with coordinated starting times (Q1127327): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4859840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding minimal length superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on the complexity of common superstring and supersequence problems / rank
 
Normal rank

Latest revision as of 14:40, 28 May 2024

scientific article
Language Label Description Also known as
English
Shortest common superstrings and scheduling with coordinated starting times
scientific article

    Statements

    Shortest common superstrings and scheduling with coordinated starting times (English)
    0 references
    0 references
    13 August 1998
    0 references
    superstrings
    0 references
    flow-shop
    0 references
    job-shop
    0 references
    NP-completeness
    0 references
    shortest common superstring problem
    0 references

    Identifiers