Methods of multiextremal optimization under constraints for separably quasimonotone functions

DOI10.1134/S1064230711020134zbMath1270.49029MaRDI QIDQ357786

Yu. A. Zak

Publication date: 13 August 2013

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

zbMATH Keywords

branch-and-bound methodmultiextremal optimizationnonconvex constraintsseparably quasimonotone functions

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global optimization with non-convex constraints. Sequential and parallel algorithms
• Global optimization to prescribed accuracy
• Branch and bound algorithm for computing the minimum stability degree of parameter‐dependent linear systems
• An Algorithm for the Traveling Salesman Problem