Pages that link to "Item:Q659795"
From MaRDI portal
The following pages link to The Graver complexity of integer programming (Q659795):
Displaying 4 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)
- \(N\)-fold integer programming and nonlinear multi-transshipment (Q628649) (← links)
- Convex integer maximization via Graver bases (Q1017675) (← links)
