Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems. (Q703298)

From MaRDI portal
Revision as of 17:06, 7 June 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
Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems.
scientific article

    Statements

    Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems. (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 January 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    Combinatorial optimization
    0 references
    branch and bound
    0 references
    artificial intelligence
    0 references