• No results found

branch and bound algorithm

Parallelization of a Branch and Bound Algorithm on Multicore Systems

Parallelization of a Branch and Bound Algorithm on Multicore Systems

... search branch-and-bound al- gorithm for MIN-based multiprocessor systems was pro- ...parallel branch-and- bound ...depth-first branch and bound algorithm for solving the ...

9

A BRANCH AND BOUND ALGORITHM FOR RESOURCE LEVELING PROBLEM

A BRANCH AND BOUND ALGORITHM FOR RESOURCE LEVELING PROBLEM

... lower bound improvement methods given in the preceding ...the algorithm to build the search tree in an effective ...the algorithm could not fathom any intermediate ...lower bound calculations ...

121

APPLICATION OF BRANCH AND BOUND ALGORITHM IN A BOTTLING SYSTEM

APPLICATION OF BRANCH AND BOUND ALGORITHM IN A BOTTLING SYSTEM

... the Branch and Bound algorithm in terms of effectiveness in providing a near-optimal solution for a travelling Salesman ...of branch and bound algorithm, application of ...

13

An extended branch and bound algorithm for linear bilevel programming

An extended branch and bound algorithm for linear bilevel programming

... extended branch and bound algorithm for linear ...the branch and bound algorithm is addressed in Section ...extended branch and bound ...

18

An interval-matrix branch-and-bound algorithm for bounding eigenvalues

An interval-matrix branch-and-bound algorithm for bounding eigenvalues

... a branch-and-bound algorithm for calculating valid bounds on the kth largest eigenvalue of a symmetric interval ...The algorithm has the theoretical property that it provides bounds to any ...

21

A Branch and Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas

A Branch and Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas

... a branch-and-bound algorithm that utilizes iterative MAXSAT solutions to generate lower and upper bounds on the size of the SMUS, and branch on specific subformulas to find ...

8

An accelerated Branch-and-Bound algorithm for assignment problems of utility systems

An accelerated Branch-and-Bound algorithm for assignment problems of utility systems

... A methodology is proposed for implementing logic and engineering knowledge within a Branch-and-Bound algorithm and with a purpose to accelerate convergence. The development addresses assignment ...

14

A parallel branch and bound algorithm for the maximum labelled clique problem

A parallel branch and bound algorithm for the maximum labelled clique problem

... Ciaran McCreesh · Patrick Prosser Received: 18 August 2014 / Accepted: 18 November 2014 © The Author(s) 2014. This article is published with open access at Springerlink.com Abstract The maximum labelled clique problem is ...

12

One-Dimensional Bin-Packing Problems with Branch and Bound Algorithm

One-Dimensional Bin-Packing Problems with Branch and Bound Algorithm

... Modified Branch and Bound Algorithm (MBBA) is developed to generate all the feasible packing patterns of given boxes to required containers for One-Dimensional ...

5

A Branch-and-Bound Algorithm for Quadratically-Constrained Sparse Filter Design

A Branch-and-Bound Algorithm for Quadratically-Constrained Sparse Filter Design

... A Branch-and-Bound Algorithm for Quadratically-Constrained Sparse Filter Design Dennis Wei and Alan ...exact algorithm for sparse filter design under a quadratic constraint on filter ...The ...

14

Adapted Branch-and-Bound Algorithm Using SVM With Model Selection

Adapted Branch-and-Bound Algorithm Using SVM With Model Selection

... (HMM) algorithm to tune the Particle Swarm optimization population size and acceleration factors parameters ...SVM algorithm to predict the performance of optimization problems ...Expectation-Maximization ...

10

Parallelization of a Maximum Parsimony Branch and Bound Algorithm for Phylogenetic Inference

Parallelization of a Maximum Parsimony Branch and Bound Algorithm for Phylogenetic Inference

... This Thesis is brought to you for free and open access by the Thesis/Dissertation Collections at RIT Scholar Works. It has been accepted for inclusion in Theses by an authorized administrator of RIT Scholar Works. For ...
A Branch and Bound Algorithm for the Global Optimization of Hessian Lipschitz Continuous Functions

A Branch and Bound Algorithm for the Global Optimization of Hessian Lipschitz Continuous Functions

... a branch and bound algorithm for the global optimization of a twice differentiable nonconvex objective function with a Lipschitz continuous Hessian over a com- pact, convex ...The algorithm is ...

30

Improvement of the branch and bound algorithm for solving the knapsack linear integer problem

Improvement of the branch and bound algorithm for solving the knapsack linear integer problem

... The branch and bound was the first algorithm to be developed in 1960 [6] for these linear integer ...the branch and bound algorithm in terms of addition of cuts to get the ...

11

A simplicial branch and duality bound algorithm for the sum of convex–convex ratios problem

A simplicial branch and duality bound algorithm for the sum of convex–convex ratios problem

... a branch and bound algorithm is proposed for solving the global optimal solution of (P(S 0 ...this algorithm consists of three basic operations: successively refined partitioning of the ...

14

Branch and Bound Algorithm for the Single Machine Scheduling Problem with Release and Delivery times

Branch and Bound Algorithm for the Single Machine Scheduling Problem with Release and Delivery times

... Keywords: Single processor, Branch and bound algorithm, Inserted idle time. Abstract. The single machine scheduling problem is one of the classic NP-hard optimization problems, and it is useful in ...

11

A Branch and Bound Algorithm for Solving the Binary Bi-level Linear Programming Problem

A Branch and Bound Algorithm for Solving the Binary Bi-level Linear Programming Problem

... a branch and bound algorithm to solve the mixed integer binary bi-level linear programming ...Their algorithm used upper and lower bounds to prune off the tree but did not use upper bounds to ...

14

Evaluation of Ant Colony Optimization Algorithm Compared to Genetic Algorithm, Dynamic Programming and Branch and Bound Algorithm Regarding Travelling Salesman Problem

Evaluation of Ant Colony Optimization Algorithm Compared to Genetic Algorithm, Dynamic Programming and Branch and Bound Algorithm Regarding Travelling Salesman Problem

... which algorithm is suitable for which ...Genetic algorithm, Dynamic programming, Branch and bound ...which algorithm serves the best in what sort of situation faced in real ...

7

Application of an Efficient Genetic Algorithm for Solving n×m Flow Shop Scheduling Problem Comparing it with Branch and Bound Algorithm and Tabu Search Algorithm

Application of an Efficient Genetic Algorithm for Solving n×m Flow Shop Scheduling Problem Comparing it with Branch and Bound Algorithm and Tabu Search Algorithm

... and Branch and Bound ...and Branch and Bound ...with Branch and Bound Algorithm and Tabu ...genetic algorithm is the best from ...

14

A branch-and-bound algorithm for the inference of ancestral. amino-acid sequences when the replacement rate varies among

A branch-and-bound algorithm for the inference of ancestral. amino-acid sequences when the replacement rate varies among

... an algorithm for “marginal” reconstruction that takes into account the rate variation among ...a branch-and- bound algorithm to reconstruct ancestral amino-acid sequences for gamma-distributed ...

26

Show all 10000 documents...

Related subjects