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

From MaRDI portal
Revision as of 20:54, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(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

    title
    A branch-and-cut method for 0-1 mixed convex programming (English)
    0 references
    DOI
    10.1007/s101070050103
    0 references
    author
    Robert A. Stubbs
    0 references
    Sanjay Mehrotra
    0 references
    publication date
    29 October 2000
    0 references
    Mathematics Subject Classification ID
    90C10
    0 references
    90C11
    0 references
    90C25
    0 references
    zbMATH DE Number
    1419751
    0 references
    zbMATH Keywords
    mixed integer programming
    0 references
    convex programming
    0 references
    OpenAlex ID
    W2049505431
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1968795&oldid=31637580"
    Powered by MediaWiki