Embedding complexity and discrete optimization. I: A new divide and conquer approach to discrete optimization (Q1400780)

From MaRDI portal
Revision as of 16:07, 20 July 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
Embedding complexity and discrete optimization. I: A new divide and conquer approach to discrete optimization
scientific article

    Statements

    Embedding complexity and discrete optimization. I: A new divide and conquer approach to discrete optimization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    14 August 2003
    0 references
    0 references
    optimization
    0 references
    discrete optimization
    0 references
    divide and qonquer
    0 references
    dynamic programming
    0 references
    dynamic-programming schemes
    0 references
    algorithmic complexity
    0 references
    computational complexity
    0 references
    embedding complexity
    0 references
    treewidth
    0 references
    LP
    0 references
    linear programming
    0 references
    ILP
    0 references
    integer linear programming
    0 references
    Boltzmann statistics for discrete optimization problems
    0 references