A Suggested Extension of Special Ordered Sets to Non-Separable Non-Convex Programming Problems (Q3923953)

From MaRDI portal
Revision as of 17:25, 20 October 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
A Suggested Extension of Special Ordered Sets to Non-Separable Non-Convex Programming Problems
scientific article

    Statements

    A Suggested Extension of Special Ordered Sets to Non-Separable Non-Convex Programming Problems (English)
    0 references
    1981
    0 references
    non-separable non-convex programming
    0 references
    branch and bound method
    0 references
    simplicial subdivision
    0 references
    hypercube
    0 references

    Identifiers