A branch and bound method for solving the bidirectional circular layout problem (Q5961820)

From MaRDI portal
Revision as of 05:01, 22 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 983104
Language Label Description Also known as
English
A branch and bound method for solving the bidirectional circular layout problem
scientific article; zbMATH DE number 983104

    Statements

    A branch and bound method for solving the bidirectional circular layout problem (English)
    0 references
    0 references
    0 references
    24 April 1997
    0 references
    facility layout
    0 references
    generalized linear ordering problem
    0 references
    manufacturing systems
    0 references
    quadratic assignment problem
    0 references
    discrete layout
    0 references
    bidirectional circular layout problem
    0 references

    Identifiers