A branch \(\&\) bound algorithm for the open-shop problem (Q1363739)

From MaRDI portal
Revision as of 13:05, 19 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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