𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A polynomial oracle-time algorithm for convex integer minimization

✍ Scribed by Raymond Hemmecke; Shmuel Onn; Robert Weismantel

Publisher
Springer-Verlag
Year
2009
Tongue
English
Weight
280 KB
Volume
126
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A VU-algorithm for convex minimization
A VU-algorithm for convex minimization
✍ Robert Mifflin; Claudia SagastizΓ‘bal πŸ“‚ Article πŸ“… 2005 πŸ› Springer-Verlag 🌐 English βš– 278 KB

For convex minimization we introduce an algorithm based on VU-space decomposition. The method uses a bundle subroutine to generate a sequence of approximate proximal points. When a primal-dual track leading to a solution and zero subgradient pair exists, these points approximate the primal track poi

An algorithm for concave integer minimiz
An algorithm for concave integer minimization over a polyhedron
✍ Harold P. Benson; S. Selcuk Erenguc πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 753 KB

We present an algorithm for solving the problem of globally minimizing a concave function over the integers contained in a compact polyhedron. The objective function of this problem need not be separable or even analytically defined. To our knowledge, the algorithm is the first ever proposed for thi