Pages that link to "Item:Q659795"
From MaRDI portal
The following pages link to The Graver complexity of integer programming (Q659795):
Displaying 11 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)
- The quadratic Graver cone, quadratic integer minimization, and extensions (Q1925790) (← links)
- \(n\)-fold integer programming in cubic time (Q1942262) (← links)
- Unboundedness of Markov complexity of monomial curves in \(\mathbb{A}^n\) for \(n \geq 4\) (Q2301979) (← links)
- The Markov complexity of book graphs (Q2682849) (← links)
- On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond (Q3457191) (← links)
- Asymptotic behavior of Markov complexity (Q6199053) (← links)
- Markov Bases: A 25 Year Update (Q6567960) (← links)
