Results 11 to 20 of about 178,189 (288)
Anomalies in parallel branch-and-bound algorithms [PDF]
Communications of the ACM, 1984 We consider the effects of parallelizing branch-and-bound algorithms by expanding several live nodes simultaneously. It is shown that it is quite possible for a parallel branch-and-bound algorithm using n 2 processors to take more time than one using n 1 processors, even though n ...
Lai, Ten-Hwang, Sahni, Sartaj
openaire +4 more sources
An implementation of a parallel generalized branch and bound template
Mathematical Modelling and Analysis, 2007 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.
Milda Baravykaitė, Raimondas Čiegis
doaj +1 more source
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 ...
Cao, Yi, Saha, Prabirkumar
core +1 more source
Time-Efficient Sub-Optimal Solutions for Dynamic Spectrum Allocation in CRN With User Fairness
IEEE Access, 2021 The incredibly increasing demand for higher rates in the last decade as well as the introduction of many new applications that require wireless connectivity necessitate proper and efficient utilization of the frequency spectrum.
Ahmed Aboulfotouh, Samy S. Soliman
doaj +1 more source
Solving Linear Integer Models with Variable Bounding
Forecasting, 2023 We present a technique to solve the linear integer model with variable bounding. By using the continuous optimal solution of the linear integer model, the variable bounds for the basic variables are approximated and then used to calculate the optimal ...
Elias Munapo +2 more
doaj +1 more source
An Exact Algorithm for Minimum Vertex Cover Problem
Mathematics, 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
Minimizing the Total Tardiness of a Game Project Considering the Overlap Effect
IEEE Access, 2020 There has long been a custom that game development is not the mainstream of engineering and its tardiness brings little or even no harm to this industry. Nowadays, the pendulum of industrial development has swung to another side.
Jen-Ya Wang +2 more
doaj +1 more source
Combining Interval Branch and Bound and Stochastic Search
Abstract and Applied Analysis, 2014 This paper presents global optimization algorithms that incorporate the idea of an interval branch and bound and the stochastic search algorithms.
Dhiranuch Bunnag
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
Study on Scheduling Problems with Learning Effects and Past Sequence Delivery Times
Mathematics, 2023 In this paper, we study a single-machine green scheduling problem with learning effects and past-sequence-dependent delivery times. The problem can be properly applied to tackle green manufacturing where production and delivery time are variable and ...
Hongyu He +5 more
doaj +1 more source