A Polynomial Time Algorithm for Vertex Enumeration and Optimization over Shaped Partition Polytopes (Q6503662)

From MaRDI portal
Revision as of 14:20, 21 November 2024 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 900397505
Language Label Description Also known as
English
A Polynomial Time Algorithm for Vertex Enumeration and Optimization over Shaped Partition Polytopes
scientific article; zbMATH DE number 900397505

    Statements

    title
    A Polynomial Time Algorithm for Vertex Enumeration and Optimization over Shaped Partition Polytopes (English)
    0 references
    author
    Frank K. Hwang
    0 references
    Shmuel Onn
    0 references
    Uriel G. Rothblum
    0 references
    publication date
    1 January 1 CEGregorian
    0 references

    Identifiers

     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6503662&oldid=37915411"
      Powered by MediaWiki