Results 11 to 20 of about 25,776 (266)

Introducing an Educational Tool for Learning Branch & Bound Strategy

open access: yesJournal 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

Evaluation of heuristics for a branch and bound algorithm to minimize the makespan in a flowshop with blocking

open access: yesActa 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

open access: yesIEEE 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

Global optimization using the branch‐and‐bound algorithm with a combination of Lipschitz bounds over simplices

open access: yesTechnological 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

An Exact Algorithm for Minimum Vertex Cover Problem

open access: yesMathematics, 2019
In this paper, we propose a branch-and-bound algorithm to solve exactly the minimum vertex cover (MVC) problem. Since a tight lower bound for MVC has a significant influence on the efficiency of a branch-and-bound algorithm, we define two novel lower ...
Luzhi Wang   +3 more
doaj   +1 more source

Globally optimal phasor measurement unit placement using branch and bound algorithm

open access: yesAin Shams Engineering Journal, 2021
This paper presents a new global optimal Phasor Measurement Unit (PMU) placement approach based on branch and bound algorithm. The proposed technique provides the global minimum number and locations of PMUs for any power system.
Mohamed Z. Kamh   +2 more
doaj   +1 more source

Enhanced Branch and Bound Algorithm: Minimizing Subproblem Complexity in Power Dispatch

open access: yesIEEE Access
The Branch and Bound (BB) algorithm, while ensuring optimality, often encounters performance bottlenecks, characterized by slow execution and high computational overhead, especially when dealing with intricate or extensive problem instances (NP-Hard ...
Elif Cesur   +2 more
doaj   +1 more source

Single Machine Problem with Multi-Rate-Modifying Activities under a Time-Dependent Deterioration

open access: yesJournal of Applied Mathematics, 2013
The single machine scheduling problem with multi-rate-modifying activities under a time-dependent deterioration to minimize makespan is studied. After examining the characteristics of the problem, a number of properties and a lower bound are proposed.
M. Huang   +5 more
doaj   +1 more source

Optimization of Export Container Relocation Operations Based on Policy Search Algorithm [PDF]

open access: yesJisuanji gongcheng
With the rapid development of port logistics and the increasing prevalence of automated container terminals, the issue of relocating export containers at specific locations in yard bays has garnered significant attention.
CHEN Yifei, HAN Xiaolong, NIU Yafan
doaj   +1 more source

An Efficient Outer Space Algorithm for Generalized Linear Multiplicative Programming Problem

open access: yesIEEE Access, 2020
Base on the outer space search and the branch-and-bound framework, this paper presents an efficient outer space branch-and-bound algorithm for globally solving generalized linear multiplicative programming problem.
Hongwei Jiao   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy