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

From MaRDI portal
Revision as of 12:35, 4 August 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-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

    Identifiers