A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments (Q2433800)

From MaRDI portal
Revision as of 18:56, 29 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
scientific article

    Statements

    A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments (English)
    0 references
    0 references
    0 references
    30 October 2006
    0 references
    linear ordering problem
    0 references
    Slater's problem
    0 references
    Kemeny's problem
    0 references
    median order
    0 references
    tournaments
    0 references
    branch and bound
    0 references
    Lagrangean relaxation
    0 references
    noising methods
    0 references
    0 references
    0 references

    Identifiers