Integer optimization on convex semialgebraic sets
From MaRDI portal
Publication:1971505
DOI10.1007/PL00009496zbMath0966.90059MaRDI QIDQ1971505
Lorant Porkolab, Leonid G. Khachiyan
Publication date: 23 March 2000
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Related Items (21)
Enumerating Integer Points in Polytopes with Bounded Subdeterminants ⋮ Complexity of integer quasiconvex polynomial optimization ⋮ Minimization of even conic functions on the two-dimensional integral lattice ⋮ Integer programming in parameterized complexity: five miniatures ⋮ A polynomial algorithm for minimizing discrete convic functions in fixed dimension ⋮ On the complexity of quasiconvex integer minimization problem ⋮ Complexity of optimizing over the integers ⋮ Unbounded convex sets for non-convex mixed-integer quadratic programming ⋮ Integer Programming in Parameterized Complexity: Three Miniatures. ⋮ Scientific contributions of Leo Khachiyan (a short overview) ⋮ Norm bounds and underestimators for unconstrained polynomial integer minimization ⋮ Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes ⋮ Integer convex minimization by mixed integer linear optimization ⋮ Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane ⋮ Unnamed Item ⋮ Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting ⋮ Piecewise linear valued constraint satisfaction problems with fixed number of variables ⋮ Scheduling meets \(n\)-fold integer programming ⋮ The complexity of relating quantum channels to master equations ⋮ Unnamed Item ⋮ Semidefinite programming
This page was built for publication: Integer optimization on convex semialgebraic sets
