Pages that link to "Item:Q1971505"

The following pages link to Integer optimization on convex semialgebraic sets (Q1971505):

Displayed 21 items.

• Norm bounds and underestimators for unconstrained polynomial integer minimization (Q684153) ‎ (← links)
• Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes (Q715233) ‎ (← links)
• The complexity of relating quantum channels to master equations (Q766099) ‎ (← links)
• Scientific contributions of Leo Khachiyan (a short overview) (Q944704) ‎ (← links)
• Semidefinite programming (Q1600854) ‎ (← links)
• Integer convex minimization by mixed integer linear optimization (Q1785273) ‎ (← links)
• Piecewise linear valued constraint satisfaction problems with fixed number of variables (Q2056915) ‎ (← links)
• A polynomial algorithm for minimizing discrete convic functions in fixed dimension (Q2192061) ‎ (← links)
• Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) ‎ (← links)
• Scheduling meets \(n\)-fold integer programming (Q2317129) ‎ (← links)
• Complexity of integer quasiconvex polynomial optimization (Q2387421) ‎ (← links)
• On the complexity of quasiconvex integer minimization problem (Q2423784) ‎ (← links)
• Unbounded convex sets for non-convex mixed-integer quadratic programming (Q2436643) ‎ (← links)
• Integer programming in parameterized complexity: five miniatures (Q2673236) ‎ (← links)
• Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane (Q2806816) ‎ (← 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)
• (Q5111743) ‎ (← links)
• (Q5155665) ‎ (← links)
• Complexity of optimizing over the integers (Q6160281) ‎ (← links)