On the complexity of postoptimality analysis of \(0/1\) programs (Q1283802)

From MaRDI portal
Revision as of 03:48, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
On the complexity of postoptimality analysis of \(0/1\) programs
scientific article

    Statements

    On the complexity of postoptimality analysis of \(0/1\) programs (English)
    0 references
    5 August 1999
    0 references
    postoptimality analysis
    0 references
    \(\varepsilon\)-optimal solutions
    0 references
    NP-hard 0/1 problems
    0 references

    Identifiers