✦ LIBER ✦

A finite algorithm for concave minimization over a polyhedron

✍ Scribed by Harold P. Benson

Publisher: John Wiley and Sons
Year: 1985
Tongue: English
Weight: 806 KB
Volume: 32
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800320119

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

Concave minimization over a convex polyh

Concave minimization over a convex polyhedron

✍ Hamdy A. Taha 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 781 KB

Successive Approximate Algorithm for Bes

Successive Approximate Algorithm for Best Approximation from a Polyhedron

✍ Shusheng Xu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 275 KB

Suppose K is the intersection of a finite number of closed half-spaces [K i ] in a Hilbert space X, and x # X "K. Dykstra's cyclic projections algorithm is a known method to determine an approximate solution of the best approximation of x from K, which is denoted by P K (x). Dykstra's algorithm redu

A modified homogeneous algorithm for fun

A modified homogeneous algorithm for function minimization

✍ D.H Jacobson; L.M Pels 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 330 KB

A hybrid algorithm for finding minimal u

A hybrid algorithm for finding minimal unsatisfiable subsets in over-constrained CSPs

✍ I. Shah 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 619 KB

Minimal Unsatisfiable Subsets (MUSes) are the subsets of constraints of an overconstrained constraint satisfaction problem (CSP) that cannot be satisfied simultaneously and therefore are responsible for the conflict in the CSP. In this paper, we present a hybrid algorithm for finding MUSes in overco

A Fully Combinatorial Algorithm for Subm

A Fully Combinatorial Algorithm for Submodular Function Minimization

✍ Satoru Iwata 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 115 KB

This paper presents a strongly polynomial algorithm for submodular function minimization using only additions, subtractions, comparisons, and oracle calls for function values.