Branch and bound with simplicial partitions for global optimization

Branch and bound methods for global optimization are considered in this paper. Advantages and disadvantages of simplicial partitions for branch and bound are shown. A new general combinatorial approach for vertex triangulation of hyper‐rectangular feasible regions is presented. Simplicial partition...

Full description

Bibliographic Details
Main Author: Julius Žilinskas
Format: Article
Language:English
Published: Vilnius Gediminas Technical University 2008-03-01
Series:Mathematical Modelling and Analysis
Subjects:
Online Access:https://journals.vgtu.lt/index.php/MMA/article/view/6998

Similar Items