Pages that link to "Item:Q2387421"
From MaRDI portal
The following pages link to Complexity of integer quasiconvex polynomial optimization (Q2387421):
Displayed 10 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)
- 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)
- On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming (Q3186487) (← links)
- Minimizing a Symmetric Quasiconvex Function on a Two-Dimensional Lattice (Q4558294) (← links)
- Centerpoints: A Link between Optimization and Convex Geometry (Q5737732) (← links)