Pages that link to "Item:Q1942262"
From MaRDI portal
The following pages link to \(n\)-fold integer programming in cubic time (Q1942262):
Displayed 30 items.
- Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory (Q314827) (← links)
- The complexity landscape of decompositional parameters for ILP (Q1749387) (← links)
- Efficient solutions for weight-balanced partitioning problems (Q1751164) (← links)
- A polyhedral model for enumeration and optimization over the set of circuits (Q2064285) (← links)
- Empowering the configuration-IP: new PTAS results for scheduling with setup times (Q2089776) (← links)
- An implementation of steepest-descent augmentation for linear programs (Q2183215) (← 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)
- Graver basis and proximity techniques for block-structured separable convex integer minimization problems (Q2248743) (← links)
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
- Scheduling meets \(n\)-fold integer programming (Q2317129) (← links)
- Parameterized resiliency problems (Q2330129) (← links)
- Huge multiway table problems (Q2339833) (← links)
- Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
- Block-structured integer programming: can we parameterize without the largest coefficient? (Q2684049) (← links)
- Huge Unimodular $n$-Fold Programs (Q3455242) (← links)
- On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond (Q3457191) (← links)
- Subset Selection in Sparse Matrices (Q4961001) (← links)
- Integer Programming in Parameterized Complexity: Three Miniatures. (Q5009484) (← links)
- (Q5090421) (← links)
- (Q5090494) (← links)
- (Q5111743) (← links)
- Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding (Q5138974) (← links)
- (Q5140719) (← links)
- Constructing Clustering Transformations (Q5150815) (← links)
- Parameterized Resiliency Problems via Integer Linear Programming (Q5283365) (← links)
- Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming (Q5864669) (← links)
- (Q5874501) (← links)
- The clever shopper problem (Q5919456) (← links)
- A colorful Steinitz lemma with application to block-structured integer programs (Q6120853) (← links)