scholarly journals On the selection of subdivision directions in interval branch-and-bound methods for global optimization

1995 ◽  
Vol 7 (2) ◽  
pp. 183-207 ◽  
Author(s):  
Dietmar Ratz ◽  
Tibor Csendes
Keyword(s):  
Global Optimization ◽  
Branch And Bound ◽  
Branch And Bound Methods ◽  
Interval Branch And Bound ◽  
Selection Of

AN IMPLEMENTATION OF A PARALLEL GENERALIZED BRANCH AND BOUND TEMPLATE

2007 ◽  
Vol 12 (3) ◽  
pp. 277-289 ◽  
Author(s):  
Milda Baravykaitė ◽  
Raimondas Čiegis
Keyword(s):  
Global Optimization ◽  
Load Balancing ◽  
Branch And Bound ◽  
Optimization Problems ◽  
Test Problems ◽  
Search Spaces ◽  
Parallel Version ◽  
Derivative Free ◽  
Template Library ◽  
Selection Of

Branch and bound (BnB) is a general algorithm to solve optimization problems. We present a template implementation of the BnB paradigm. A BnB template is implemented using C++ object oriented paradigm. MPI is used for underlying communications. A paradigm of domain decomposition (data parallelization) is used to construct a parallel algorithm. To obtain a better load balancing, the BnB template has the load balancing module that allows the redistribution of search spaces among the processors at run time. A parallel version of user's algorithm is obtained automatically. A new derivative-free global optimization algorithm is proposed for solving nonlinear global optimization problems. It is based on the BnB algorithm and its implementation is done by using the developed BnB algorithm template library. The robustness of the new algorithm is demonstrated by solving a selection of test problems.

scholarly journals BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION

2008 ◽  
Vol 13 (1) ◽  
pp. 145-159 ◽  
Author(s):  
J. Žilinskas
Keyword(s):  
Global Optimization ◽  
Branch And Bound ◽  
Linear Inequality ◽  
Optimization Problems ◽  
Inequality Constraints ◽  
Combinatorial Approach ◽  
Rectangular Shape ◽  
Linear Inequality Constraints ◽  
Advantages And Disadvantages ◽  
Branch And Bound Methods

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 partitions may be used to vertex triangulate feasible regions of non rectangular shape defined by linear inequality constraints. Linear inequality constraints may be used to avoid symmetries in optimization problems.

scholarly journals On estimating workload in interval branch-and-bound global optimization algorithms

2011 ◽  
Vol 56 (3) ◽  
pp. 821-844 ◽  
Author(s):  
José L. Berenguel ◽  
L. G. Casado ◽  
I. García ◽  
Eligius M. T. Hendrix
Keyword(s):  
Global Optimization ◽  
Branch And Bound ◽  
Optimization Algorithms ◽  
Interval Branch And Bound
Sign in / Sign up

Export Citation Format

Share Document