The following pages link to \(N\)-fold integer programming (Q951095):
Displaying 9 items.
- Lower bounds on the graver complexity of \(M\)-fold matrices (Q259721) (← links)
- Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory (Q314827) (← links)
- A polynomial oracle-time algorithm for convex integer minimization (Q623465) (← links)
- \(N\)-fold integer programming and nonlinear multi-transshipment (Q628649) (← links)
- The Graver complexity of integer programming (Q659795) (← links)
- Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes (Q715233) (← links)
- Convex integer maximization via Graver bases (Q1017675) (← links)
- Efficient solutions for weight-balanced partitioning problems (Q1751164) (← links)
- Robust integer programming (Q1785307) (← links)
