Decomposition of the location problem (Q1819693)

From MaRDI portal
Revision as of 05:47, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Decomposition of the location problem
scientific article

    Statements

    title
    Decomposition of the location problem (English)
    0 references
    publication date
    1986
    0 references
    review text
    A decomposition algorithm is proposed for the location problem (LP). In addition to being suitable for the realization of branching in branch- and-bound algorithms, this algorithm provides a constructive scheme for the proof of polynomial solvability of new classes of LP and for the extension of known polynomially solvable particular cases of LP.
    0 references
    zbMATH DE Number
    3993253
    0 references
    zbMATH Keywords
    decomposition algorithm
    0 references
    location problem
    0 references
    branch-and-bound
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1819693&oldid=26508976"
    Powered by MediaWiki