Pages that link to "Item:Q2192061"
From MaRDI portal
The following pages link to A polynomial algorithm for minimizing discrete convic functions in fixed dimension (Q2192061):
Displaying 9 items.
- A polynomial oracle-time algorithm for convex integer minimization (Q623465) (← links)
- \(\varepsilon\)-approximation minimization of convex functions in fixed dimension (Q1919184) (← links)
- On lattice point counting in \(\varDelta\)-modular polyhedra (Q2162684) (← links)
- On the complexity of quasiconvex integer minimization problem (Q2423784) (← links)
- Minimization of even conic functions on the two-dimensional integral lattice (Q5090143) (← links)
- (Q5391189) (← links)
- Critical properties of bipartite permutation graphs (Q6142657) (← links)
- On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems (Q6200377) (← links)
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems (Q6593834) (← links)