A branch \(\&\) bound algorithm for the open-shop problem (Q1363739): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q322694
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Johann L. Hurink / rank
 
Normal rank

Revision as of 20:56, 12 February 2024

scientific article
Language Label Description Also known as
English
A branch \(\&\) bound algorithm for the open-shop problem
scientific article

    Statements

    A branch \(\&\) bound algorithm for the open-shop problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 February 1998
    0 references
    branch-and-bound
    0 references
    open-shop problem
    0 references
    disjunctive graph
    0 references

    Identifiers