Pages that link to "Item:Q1752617"
From MaRDI portal
The following pages link to FPT-algorithms for some problems related to integer programming (Q1752617):
Displayed 6 items.
- An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem (Q2117618) (← links)
- On lattice point counting in \(\varDelta\)-modular polyhedra (Q2162684) (← links)
- FPT-algorithm for computing the width of a simplex given by a convex hull (Q2314204) (← links)
- Enumeration and unimodular equivalence of empty delta-modular simplices (Q6134052) (← links)
- Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems (Q6181364) (← links)
- On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems (Q6200377) (← links)