✦ LIBER ✦

A Simple Finite Cone Covering Algorithm for Concave Minimization

✍ Scribed by Christophe Meyer

Book ID: 111564728
Publisher: Springer US
Year: 2000
Tongue: English
Weight: 69 KB
Volume: 18
Category: Article
ISSN: 0925-5001
DOI: 10.1023/a:1026548217241

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cone Adaptation Strategies for a Finite

Cone Adaptation Strategies for a Finite and Exact Cutting Plane Algorithm for Concave Minimization

✍ Marcus Porembski 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 297 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

A Finite Algorithm for Global Minimizati

A Finite Algorithm for Global Minimization of Separable Concave Programs

✍ J. Parker Shectman; Nikolaos V. Sahinidis 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 249 KB

A New Successive Partition Algorithm for

A New Successive Partition Algorithm for Concave Minimization Based on Cone Decomposition and Decomposition Cuts

✍ Marcus Porembski 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 347 KB

A finite concave minimization algorithm

A finite concave minimization algorithm using branch and bound and neighbor generation

✍ Harold P. Benson; Serpil Sayin 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 821 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