Can Pure Cutting Plane Algorithms Work? (Q3503863)

From MaRDI portal
Revision as of 13:11, 29 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Can Pure Cutting Plane Algorithms Work?
scientific article

    Statements

    title
    Can Pure Cutting Plane Algorithms Work? (English)
    0 references
    author
    Arrigo Zanette
    0 references
    Matteo Fischetti
    0 references
    Egon Balas
    0 references
    publication date
    10 June 2008
    0 references
    Mathematics Subject Classification ID
    90C57
    0 references
    90-08
    0 references
    90C05
    0 references
    zbMATH DE Number
    5285922
    0 references
    zbMATH Keywords
    Cutting Plane Methods
    0 references
    Gomory Cuts
    0 references
    Degeneracy in Linear Programming
    0 references
    Lexicographic Dual Simplex
    0 references
    Computational Analysis
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3503863&oldid=23858136"
    Powered by MediaWiki