Results 11 to 20 of about 35,838 (299)
A new branch and bound algorithm for minimax ratios problems
Open Mathematics, 2017 This study presents an efficient branch and bound algorithm for globally solving the minimax fractional programming problem (MFP). By introducing an auxiliary variable, an equivalent problem is firstly constructed and the convex relaxation programming ...
Zhao Yingfeng, Liu Sanyang, Jiao Hongwei
doaj +3 more sources
Design, implementation and testing of an integrated branch and bound algorithm for piecewise linear and discrete programming problems within an LP framework [PDF]
, 1992 A number of discrete variable representations are well accepted and find regular use within LP systems. These are Binary variables, General Integer variables, Variable Upper Bounds or Semi Continuous variables, Special Ordered Sets of type One and type ...
Mitra, G, Hajian, MT
core +6 more sources
Improved branch and bound method for control structure screening [PDF]
, 2005 The main aim of this paper is to present an improved algorithm of “Branch and Bound” method for control structure screening. The new algorithm uses a best- first search approach, which is more efficient than other algorithms based on depth-first search ...
Saha, Prabirkumar, Cao, Yi
core +1 more source
Bidirectional branch and bound for controlled variable selection. Part I: principles and minimum singular value criterion. [PDF]
, 2008 The minimum singular value (MSV) rule is a useful tool for selecting controlled variables (CVs) from the available measurements. However, the application of the MSV rule to large-scale problems is difficult, as all feasible measurement subsets need to
Kariwala, Vinay, Cao, Yi
core +1 more source
Introducing an Educational Tool for Learning Branch & Bound Strategy
Journal of Information Systems Engineering and Business Intelligence, 2017 —According to our informal survey, Branch & Bound strategy is considerably difficult to learn compared to other strategies. This strategy consists of several complex algorithmic steps such as Reduced Cost Matrix (RCM) calculation and Breadth First Search.
Sofriesilero Zumaytis, Oscar Karnalim
doaj +1 more source
Acta Scientiarum: Technology, 2016 This paper has the objective to evaluate the use of different methods to obtain an initial solution for the branch and bound algorithm with the objective of minimizing the makespan in a flowshop with zero buffer environment. As the problem is known to be
Felipe Borreiro Sanches +2 more
doaj +1 more source
Optimized Data Association Based on Gaussian Mixture Model
IEEE Access, 2020 Data association is the foundation of state estimation in mobile robot simultaneous localization and mapping. Aiming at the problems of false association, high computational complexity in joint compatible branch and bound algorithm, we propose an ...
Xiaogang Ruan +3 more
doaj +1 more source
Technological and Economic Development of Economy, 2009 Many problems in economy may be formulated as global optimization problems. Most numerically promising methods for solution of multivariate unconstrained Lipschitz optimization problems of dimension greater than 2 use rectangular or simplicial branch‐and‐
Remigijus Paulavičius +1 more
doaj +1 more source
Bidirectional branch and bound for controlled variable selection. Part III: local average loss minimization [PDF]
, 2010 The selection of controlled variables (CVs) from available measurements through exhaustive search is computationally forbidding for large-scale processes. We have recently proposed novel bidirectional branch and bound (B-3) approaches for CV selection
Kariwala, Vinay, Cao, Yi
core +1 more source
Bidirectional branch and bound for controlled variable selection. Part II: exact local method for self-optimizing control [PDF]
, 2009 The selection of controlled variables (CVs) from available measurements through enumeration of all possible alternatives is computationally forbidding for large-dimensional problems. In Part I of this work [Cao, Y., & Kariwala, V.
Vinay Cao +5 more
core +1 more source