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 17 items.
- Lower bounds on the graver complexity of \(M\)-fold matrices (Q259721) (← links)
- \(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 power of pyramid decomposition in Normaliz (Q898277) (← links)
- The fiber dimension of a graph (Q1618232) (← links)
- Solving MIPs via scaling-based augmentation (Q1662107) (← links)
- Edges versus circuits: a hierarchy of diameters in polyhedra (Q1707378) (← links)
- Robust integer programming (Q1785307) (← links)
- The quadratic Graver cone, quadratic integer minimization, and extensions (Q1925790) (← links)
- \(n\)-fold integer programming in cubic time (Q1942262) (← links)
- Graver basis and proximity techniques for block-structured separable convex integer minimization problems (Q2248743) (← links)
- Huge multiway table problems (Q2339833) (← links)
- Alternatives for testing total dual integrality (Q2429472) (← links)
- Convex integer optimization by constantly many linear counterparts (Q2451653) (← links)
- Huge Unimodular $n$-Fold Programs (Q3455242) (← links)
- On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond (Q3457191) (← links)