✦ LIBER ✦

Normal conical algorithm for concave minimization over polytopes

✍ Scribed by Hoang Tuy

Book ID: 105250461
Publisher: Springer-Verlag
Year: 1991
Tongue: English
Weight: 894 KB
Volume: 51
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01586935

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finite Exact Branch-and-Bound Algorithms

Finite Exact Branch-and-Bound Algorithms for Concave Minimization over Polytopes

✍ Marco Locatelli; Nguyen V. Thoai 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 130 KB

Conical algorithm for the global minimiz

Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems

✍ R. Horst; N. V. Thoai 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 872 KB

A finite algorithm for concave minimizat

A finite algorithm for concave minimization over a polyhedron

✍ Harold P. Benson 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 806 KB

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

On a Finite Branch and Bound Algorithm f

On a Finite Branch and Bound Algorithm for the Global Minimization of a Concave Power Law Over a Polytope

✍ Vasilios I. Manousiouthakis; Neil Thomas; Ahmad M. Justanieah 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 460 KB

A branch and bound-outer approximation a

A branch and bound-outer approximation algorithm for concave minimization over a convex set

✍ Harold P. Benson; Reiner Horst 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 599 KB