Pages that link to "Item:Q623465"
From MaRDI portal
The following pages link to A polynomial oracle-time algorithm for convex integer minimization (Q623465):
Displayed 6 items.
- \(N\)-fold integer programming and nonlinear multi-transshipment (Q628649) (← links)
- Cone superadditivity of discrete convex functions (Q715073) (← links)
- Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes (Q715233) (← links)
- The quadratic Graver cone, quadratic integer minimization, and extensions (Q1925790) (← links)
- \(n\)-fold integer programming in cubic time (Q1942262) (← links)
- Alternatives for testing total dual integrality (Q2429472) (← links)