Pages that link to "Item:Q1941539"
From MaRDI portal
The following pages link to A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity \(2^{O(n\log n)}\) (Q1941539):
Displayed 18 items.
- A randomized sieving algorithm for approximate integer programming (Q486990) (← links)
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods (Q494329) (← links)
- Norm bounds and underestimators for unconstrained polynomial integer minimization (Q684153) (← links)
- A general scheme for solving a large set of scheduling problems with rejection in FPT time (Q2142679) (← links)
- A polynomial algorithm for minimizing discrete convic functions in fixed dimension (Q2192061) (← links)
- On the rational polytopes with Chvátal rank 1 (Q2288183) (← links)
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
- FPT-algorithm for computing the width of a simplex given by a convex hull (Q2314204) (← links)
- Scheduling meets \(n\)-fold integer programming (Q2317129) (← links)
- On the complexity of quasiconvex integer minimization problem (Q2423784) (← links)
- Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
- On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming (Q3186487) (← links)
- Minimizing a Symmetric Quasiconvex Function on a Two-Dimensional Lattice (Q4558294) (← links)
- Integer Programming in Parameterized Complexity: Three Miniatures. (Q5009484) (← links)
- Enumerating Integer Points in Polytopes with Bounded Subdeterminants (Q5062109) (← links)
- Minimization of even conic functions on the two-dimensional integral lattice (Q5090143) (← links)
- Centerpoints: A Link between Optimization and Convex Geometry (Q5737732) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)