๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron

โœ Scribed by Kurt M. Bretthauer; A.Victor Cabot

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
906 KB
Volume
21
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Variations on a cutting plane method for
Variations on a cutting plane method for solving concave minimization problems with linear constraints
โœ A. Victor Cabot ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 534 KB

## Abstract A cutting plane method for solving concave minimization problems with linear constraints has been advanced by Tui. The principle behind this cutting plane has been applied to integer programming by Balas, Young, Glover, and others under the name of convexity cuts. This paper relates th