On estimates of the complexity of numerical characteristics of postoptimality analysis for discrete optimization problems (Q466348)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On estimates of the complexity of numerical characteristics of postoptimality analysis for discrete optimization problems
scientific article

    Statements

    On estimates of the complexity of numerical characteristics of postoptimality analysis for discrete optimization problems (English)
    0 references
    27 October 2014
    0 references
    postoptimality analysis
    0 references
    complexity of the branch and bound method
    0 references
    completely unimodular matrix
    0 references

    Identifiers