Pages that link to "Item:Q2387421"
From MaRDI portal
The following pages link to Complexity of integer quasiconvex polynomial optimization (Q2387421):
Displaying 18 items.
- A randomized sieving algorithm for approximate integer programming (Q486990) (← links)
- Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes (Q715233) (← links)
- Scheduling and fixed-parameter tractability (Q896271) (← links)
- Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time (Q1617277) (← links)
- Integer convex minimization by mixed integer linear optimization (Q1785273) (← 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)
- FPT-algorithm for computing the width of a simplex given by a convex hull (Q2314204) (← 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)
- On the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set and Applications (Q5300525) (← links)
- Centerpoints: A Link between Optimization and Convex Geometry (Q5737732) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)
