A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem (Q3133219)

From MaRDI portal
Revision as of 15:20, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem
scientific article

    Statements

    title
    A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem (English)
    0 references
    author
    Irina Utkina
    0 references
    Mikhail Batsyn
    0 references
    Ekaterina Batsyna
    0 references
    publication date
    13 February 2018
    0 references
    Mathematics Subject Classification ID
    90C09
    0 references
    90C32
    0 references
    90C57
    0 references
    zbMATH DE Number
    6837849
    0 references
    zbMATH Keywords
    cell formation
    0 references
    biclustering
    0 references
    branch and bound
    0 references
    upper bound
    0 references
    exact solution
    0 references
    OpenAlex ID
    W2299898751
    0 references
    arXiv ID
    1603.04597
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3133219&oldid=33602692"
    Powered by MediaWiki