Two branch and bound algorithms for the permutation flow shop problem (Q1266538)

From MaRDI portal
Revision as of 15:35, 28 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Two branch and bound algorithms for the permutation flow shop problem
scientific article

    Statements

    Two branch and bound algorithms for the permutation flow shop problem (English)
    0 references
    0 references
    0 references
    29 November 1998
    0 references
    branch-and-bound
    0 references
    exact methods
    0 references
    permutation flow shop problem
    0 references
    heads and tails
    0 references

    Identifiers