✦ LIBER ✦

Generalized γ-Valid Cut Procedure for Concave Minimization

✍ Scribed by H. P. Benson

Book ID: 110411174
Publisher: Springer
Year: 1999
Tongue: English
Weight: 420 KB
Volume: 102
Category: Article
ISSN: 0022-3239
DOI: 10.1023/a:1021776323080

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finitely convergent cutting planes for c

Finitely convergent cutting planes for concave minimization

✍ Marcus Porembski 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 815 KB

A penalty for concave minimization deriv

A penalty for concave minimization derived from the tuy cutting plane

✍ Kurt M. Bretthauer 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 576 KB

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 composite branch and bound, cutting pl

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

✍ Kurt M. Bretthauer; A.Victor Cabot 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 906 KB

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

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