On Convergence of the Simplicial Branch-and-Bound Algorithm Based on ω-Subdivisions

M. Locatelli and U. Raber
Additional contact information
M. Locatelli: Universitá di Torino
U. Raber: University of Trier

Journal of Optimization Theory and Applications, 2000, vol. 107, issue 1, No 4, 69-79

Abstract: Abstract The problem of minimizing a concave function over a polytope is considered. The simplicial branch-and-bound approach is presented and theoretical studies about the convergence of these algorithms are carried on. In particular, the convergence of the algorithm based on so-called ω-subdivisions is proved, which had been an open question for a long time.

Keywords: concave minimization; ω-subdivisions; convergence (search for similar items in EconPapers)
Date: 2000
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1023/A:1004604732705 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:107:y:2000:i:1:d:10.1023_a:1004604732705

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1023/A:1004604732705

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().