Pages that link to "Item:Q2248743"

The following pages link to Graver basis and proximity techniques for block-structured separable convex integer minimization problems (Q2248743):

Displaying 12 items.

• On two theorems about local automorphisms of geometric structures (Q332172) (← links)
• The power of pyramid decomposition in Normaliz (Q898277) (← links)
• Solving MIPs via scaling-based augmentation (Q1662107) (← links)
• Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
• Scheduling meets \(n\)-fold integer programming (Q2317129) (← links)
• A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs (Q5002764) (← links)
• (Q5111743) (← links)
• (Q5140719) (← links)
• Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming (Q5864669) (← links)
• (Q5874501) (← links)
• High-multiplicity \(N\)-fold IP via configuration LP (Q6044979) (← links)
• FPT algorithms for a special block-structured integer program with applications in scheduling (Q6634532) (← links)