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

From MaRDI portal
Revision as of 21:18, 26 June 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q126666733, #quickstatements; #temporary_batch_1719432696450)
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