Pages that link to "Item:Q5002764"

The following pages link to A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs (Q5002764):

Displaying 30 items.

• On some FPT problems without polynomial Turing compressions (Q2072079) (← links)
• Empowering the configuration-IP: new PTAS results for scheduling with setup times (Q2089776) (← links)
• About the complexity of two-stage stochastic IPs (Q2118129) (← links)
• The complexity of vector partition (Q2155634) (← links)
• Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
• The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints (Q2238737) (← links)
• Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
• On degree sequence optimization (Q2661577) (← links)
• Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
• Approximate separable multichoice optimization over monotone systems (Q2673246) (← links)
• Block-structured integer programming: can we parameterize without the largest coefficient? (Q2684049) (← links)
• Subset Selection in Sparse Matrices (Q4961001) (← links)
• Integer Programming in Parameterized Complexity: Three Miniatures. (Q5009484) (← links)
• About the Complexity of Two-Stage Stochastic IPs (Q5041750) (← links)
• (Q5090421) (← links)
• (Q5090494) (← links)
• (Q5091234) (← links)
• Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding (Q5138974) (← links)
• Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming (Q5864669) (← links)
• (Q5874501) (← links)
• Parameterized shifted combinatorial optimization (Q5915595) (← links)
• The clever shopper problem (Q5919456) (← links)
• High-multiplicity \(N\)-fold IP via configuration LP (Q6044979) (← links)
• A colorful Steinitz lemma with application to block-structured integer programs (Q6120853) (← links)
• Asymptotic behavior of Markov complexity (Q6199053) (← links)
• Markov Bases: A 25 Year Update (Q6567960) (← links)
• Discrete preference games with logic-based agents: formal framework, complexity, and islands of tractability (Q6579293) (← 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)
• Circuit and Graver walks and linear and integer programming (Q6670505) (← links)