A polynomial oracle-time algorithm for convex integer minimization (Q623465)

From MaRDI portal
Revision as of 02:49, 2 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 polynomial oracle-time algorithm for convex integer minimization
scientific article

    Statements

    A polynomial oracle-time algorithm for convex integer minimization (English)
    0 references
    0 references
    0 references
    0 references
    14 February 2011
    0 references
    0 references
    greedy augmentation procedure
    0 references
    polynomial time algorithm
    0 references