A polynomial oracle-time algorithm for convex integer minimization (Q623465): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:16, 30 January 2024
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
14 February 2011
0 references
greedy augmentation procedure
0 references
polynomial time algorithm
0 references
