• No results found

Algorithm and performance bound

Parallelization of a Branch and Bound Algorithm on Multicore Systems

Parallelization of a Branch and Bound Algorithm on Multicore Systems

... same performance, a deeper level needs a much larger pool size to cover the same portion of the upper tree as in the lower ...old algorithm for smaller pool ...

9

A BRANCH AND BOUND ALGORITHM FOR RESOURCE LEVELING PROBLEM

A BRANCH AND BOUND ALGORITHM FOR RESOURCE LEVELING PROBLEM

... Year of PublicationAuthor(s)MethodProblem(s)Remarks 1971Mason and MoodieBranch and BoundProject Duration Minimization and RLPCombined cost of resource demand fluctuations and delays areminimized. Delays in cpm duration ...

121

An extended branch and bound algorithm for linear bilevel programming

An extended branch and bound algorithm for linear bilevel programming

... and bound algorithm for linear BLP can solve a wider class of problems than current capabilities ...and bound algorithm is that it could not well solve a linear BLP problem when constraint ...

18

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

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

... 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 arbitrary ...

21

Parallelization of the Branch-and-Bound Algorithm in Transportation Discrete Network Design

Parallelization of the Branch-and-Bound Algorithm in Transportation Discrete Network Design

... genetic algorithm for the problem of transit routes network design, while minimizing the total system ...genetic algorithm, in which the tness function was evaluated, concur- rently, for the ...solutions. ...

13

Branch and Bound Algorithm for Dependency Parsing with Non local Features

Branch and Bound Algorithm for Dependency Parsing with Non local Features

... There have been numerous studies on global in- ference algorithms for general higher order parsing. One popular approach is reranking (Collins, 2000; Charniak and Johnson, 2005; Hall, 2007). It typi- cally has two steps: ...

12

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

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

... connections we may use. A mathematical programming approach to solving the problem was presented by Carrabs et al., who used CPLEX to provide experimental results on a range of graph instances. Here we introduce the ...

12

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

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

... 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

Inference in credal networks: branch-and-bound methods and the A/R+ algorithm

Inference in credal networks: branch-and-bound methods and the A/R+ algorithm

... the performance of best-first branch-and-bound meth- ods for ...the algorithm up to a prescribed memory limit; upon termination, the OPEN heap is examined, and the element with the maximum ...

18

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

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

... the performance of algorithms, there are techniques used to tune parameters such as Fuzzy Logic controller for Ant Colony System (ACS) epsilon parameter ...(HMM) algorithm to tune the Particle Swarm ...

10

A Fast Color Based Branch and Bound Algorithm for Maximum Clique Problem

A Fast Color Based Branch and Bound Algorithm for Maximum Clique Problem

... time algorithm to find exact solution efficiently [9], but using various heuristics, the performance of algorithm may be obtained ...branch-and- bound, and backtracking ...and bound ...

6

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

... new algorithm for the minimisation of of a twice differentiable nonconvex objective function with a Lipschitz continuous Hessian over a compact, convex ...The algorithm is based on the canonical branch and ...

30

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

... their performance, like time complexity, space complexity, scalability, ...which algorithm is suitable for which ...Genetic algorithm, Dynamic programming, Branch and bound ...the ...

7

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

... BBI algorithm. The BBI algorithm performs better than the Carlier algorithm in finding an optimal schedule with fewer branch nodes for instances from the group ...3 performance of two ...

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

... upper bound for the optimal feasible solution, are significantly ...excellent performance by both the bounding function and the algorithm in ...

14

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

... 23 8. Conclusion As the garments factory is increasing day by day in the Asian Subcontinent for economic growth, flow shop scheduling problems of increasing machines and jobs show the stiffness. Reducing this difficulty, ...

14

A Genetic Algorithms Approach to Modeling the Performance of Memory-bound Computations

A Genetic Algorithms Approach to Modeling the Performance of Memory-bound Computations

... the performance of HPC applications based on the results of such ...Genetic Algorithm approach is used to "learn" bandwidth as a function of cache hit rates per ma- chine with MultiMAPS as the fitness ...

12

Research Article Heuristic-Based Firefly Algorithm for Bound Constrained Nonlinear Binary Optimization

Research Article Heuristic-Based Firefly Algorithm for Bound Constrained Nonlinear Binary Optimization

... firefly algorithm, three different implementations aiming to incorporate the heuristics for binary variables into FA are proposed (mCS, mBS, and ...The performance of this simple heuristic strategy will be ...

13

A Branch and Bound Based Heuristic Algorithm for Minimizing Makespan in Machining Assembly Flowshop Scheduling

A Branch and Bound Based Heuristic Algorithm for Minimizing Makespan in Machining Assembly Flowshop Scheduling

... the performance measure than that of the current ...lower bound like a branch and bound algorithm and the size of neighborhood is restricted by the value of X ...

10

Nurse Scheduling Based on Branch- and- Bound Algorithm

Nurse Scheduling Based on Branch- and- Bound Algorithm

... In the field of nurse rostering, some decomposition techniques have been investigated over recent passed years. Aickelin and Dowsland [24] developed a genetic algorithm with an indirect representation. Different ...

7

Show all 10000 documents...

Related subjects