Pages that link to "Item:Q3569820"

The following pages link to A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs (Q3569820):

Displaying 12 items.

• \(n\)-fold integer programming in cubic time (Q1942262) (← links)
• The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints (Q2238737) (← links)
• Graver basis and proximity techniques for block-structured separable convex integer minimization problems (Q2248743) (← links)
• Huge multiway table problems (Q2339833) (← links)
• Convex integer optimization by constantly many linear counterparts (Q2451653) (← links)
• Block-structured integer programming: can we parameterize without the largest coefficient? (Q2684049) (← links)
• Huge Unimodular $n$-Fold Programs (Q3455242) (← links)
• Subset Selection in Sparse Matrices (Q4961001) (← 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)
• A colorful Steinitz lemma with application to block-structured integer programs (Q6120853) (← links)
• FPT algorithms for a special block-structured integer program with applications in scheduling (Q6634532) (← links)