A branch-and-cut method for 0-1 mixed convex programming (Q1968795)

From MaRDI portal
Revision as of 22:30, 29 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
A branch-and-cut method for 0-1 mixed convex programming
scientific article

    Statements

    A branch-and-cut method for 0-1 mixed convex programming (English)
    0 references
    0 references
    0 references
    29 October 2000
    0 references
    mixed integer programming
    0 references
    convex programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references