Pages that link to "Item:Q2205969"

The following pages link to Combinatorial \(n\)-fold integer programming and applications (Q2205969):

Displaying 11 items.

• A parameterized perspective on protecting elections (Q2034407) (← links)
• Empowering the configuration-IP: new PTAS results for scheduling with setup times (Q2089776) (← links)
• Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
• Approximation and hardness of shift-Bribery (Q2238694) (← links)
• The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints (Q2238737) (← links)
• Parameterized complexity of configuration integer programs (Q2670456) (← links)
• Block-structured integer programming: can we parameterize without the largest coefficient? (Q2684049) (← links)
• (Q5874501) (← links)
• High-multiplicity \(N\)-fold IP via configuration LP (Q6044979) (← links)
• A colorful Steinitz lemma with application to block-structured integer programs (Q6120853) (← links)
• A multivariate complexity analysis of the material consumption scheduling problem (Q6136081) (← links)