Pages that link to "Item:Q5002764"
From MaRDI portal
The following pages link to A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs (Q5002764):
Displaying 19 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)
- Integer Programming in Parameterized Complexity: Three Miniatures. (Q5009484) (← links)
- (Q5090421) (← links)
- (Q5090494) (← links)
- (Q5091234) (← 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)
- Asymptotic behavior of Markov complexity (Q6199053) (← links)
