An exact branch and bound algorithm for the Steiner Problem in Graphs

1995 ◽  
pp. 582-590 ◽  
Author(s):  
B. N. Khoury ◽  
P. M. Pardalos
Keyword(s):  
Branch And Bound ◽  
Branch And Bound Algorithm ◽  
Steiner Problem

A grid-enabled distributed branch-and-bound algorithm with application on the Steiner Problem in graphs

2006 ◽  
Vol 32 (9) ◽  
pp. 629-642 ◽  
Author(s):  
Lúcia M.A. Drummond ◽  
Eduardo Uchoa ◽  
Alexandre D. Gonçalves ◽  
Juliana M.N. Silva ◽  
Marcelo C.P. Santos ◽  
...  
Keyword(s):  
Branch And Bound ◽  
Branch And Bound Algorithm ◽  
Steiner Problem

Unit Commitment Solution by Branch and Bound Algorithm

2020 ◽  
Author(s):  
Bishaljit Paul ◽  
Sushovan Goswami ◽  
Dipu Mistry ◽  
Chandan Kumar Chanda
Keyword(s):  
Branch And Bound ◽  
Unit Commitment ◽  
Branch And Bound Algorithm

scholarly journals Identification of mechanical properties of arteries with certification of global optimality

2021 ◽  
Author(s):  
Jan-Lucas Gade ◽  
Carl-Johan Thore ◽  
Jonas Stålhand
Keyword(s):  
Global Solution ◽  
Branch And Bound ◽  
Clinical Data ◽  
Minimization Problem ◽  
Branch And Bound Algorithm ◽  
Stationary Points ◽  
Model Parameters ◽  
Global Optimality ◽  
Clinical Value ◽  
Non Linear

AbstractIn this study, we consider identification of parameters in a non-linear continuum-mechanical model of arteries by fitting the models response to clinical data. The fitting of the model is formulated as a constrained non-linear, non-convex least-squares minimization problem. The model parameters are directly related to the underlying physiology of arteries, and correctly identified they can be of great clinical value. The non-convexity of the minimization problem implies that incorrect parameter values, corresponding to local minima or stationary points may be found, however. Therefore, we investigate the feasibility of using a branch-and-bound algorithm to identify the parameters to global optimality. The algorithm is tested on three clinical data sets, in each case using four increasingly larger regions around a candidate global solution in the parameter space. In all cases, the candidate global solution is found already in the initialization phase when solving the original non-convex minimization problem from multiple starting points, and the remaining time is spent on increasing the lower bound on the optimal value. Although the branch-and-bound algorithm is parallelized, the overall procedure is in general very time-consuming.

A branch and bound algorithm for the generalized assignment problem

1975 ◽  
Vol 8 (1) ◽  
pp. 91-103 ◽  
Author(s):  
G. Terry Ross ◽  
Richard M. Soland
Keyword(s):  
Branch And Bound ◽  
Assignment Problem ◽  
Branch And Bound Algorithm ◽  
Generalized Assignment Problem ◽  
Generalized Assignment
Sign in / Sign up

Export Citation Format

Share Document