The following pages link to \(N\)-fold integer programming (Q951095):
Displaying 42 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)
- The quadratic Graver cone, quadratic integer minimization, and extensions (Q1925790) (← links)
- The algebra of reversible Markov chains (Q1934489) (← links)
- \(n\)-fold integer programming in cubic time (Q1942262) (← links)
- The complexity of vector partition (Q2155634) (← links)
- Compact representation of near-optimal integer programming solutions (Q2191768) (← links)
- Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
- Computational complexity of three-dimensional discrete tomography with missing data (Q2231602) (← links)
- Graver basis and proximity techniques for block-structured separable convex integer minimization problems (Q2248743) (← links)
- A heuristic method for solving integer-valued decompositional multiindex problems (Q2261778) (← links)
- Unboundedness of Markov complexity of monomial curves in \(\mathbb{A}^n\) for \(n \geq 4\) (Q2301979) (← links)
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
- Huge multiway table problems (Q2339833) (← links)
- Portfolio-optimization models for small investors (Q2392807) (← links)
- Convex integer optimization by constantly many linear counterparts (Q2451653) (← links)
- When is rounding allowed in integer nonlinear optimization? (Q2514870) (← links)
- Block-structured integer programming: can we parameterize without the largest coefficient? (Q2684049) (← links)
- Theory and Applications of n-Fold Integer Programming (Q2897311) (← 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)
- (Q3747237) (← links)
- Subset Selection in Sparse Matrices (Q4961001) (← links)
- Faster Algorithms for Integer Programs with Block Structure (Q5002724) (← links)
- (Q5091234) (← links)
- Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding (Q5138974) (← links)
- A Polyhedral Frobenius Theorem with Applications to Integer Optimization (Q5499737) (← links)
- (Q5874501) (← links)
- The double exponential runtime is tight for 2-stage stochastic ILPs (Q5918430) (← links)
- The double exponential runtime is tight for 2-stage stochastic ILPs (Q5925653) (← links)
- High-multiplicity \(N\)-fold IP via configuration LP (Q6044979) (← links)
- A colorful Steinitz lemma with application to block-structured integer programs (Q6120853) (← links)
- Markov Bases: A 25 Year Update (Q6567960) (← links)
- FPT algorithms for a special block-structured integer program with applications in scheduling (Q6634532) (← links)
- Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming (Q6634533) (← links)
