Search Results - subject:"branch and bound"

Exclusion regions for optimization problems

Schichl, Hermann; Markót, Mihály; Neumaier, Arnold - In: Journal of Global Optimization 59 (2014) 2, pp. 569-595

Branch and bound methods for finding all solutions of a global optimization problem in a box frequently have the …

Persistent link: https://www.econbiz.de/10010994111

Speeding up branch and bound algorithms for solving the maximum clique problem

Maslov, Evgeny; Batsyn, Mikhail; Pardalos, Panos - In: Journal of Global Optimization 59 (2014) 1, pp. 1-21

In this paper we consider two branch and bound algorithms for the maximum clique problem which demonstrate the best … branch and bound algorithms on hard instances. The idea is to apply a powerful heuristic for obtaining an initial solution of … high quality. This solution is then used to prune branches in the main branch and bound algorithm. For this purpose we …

Persistent link: https://www.econbiz.de/10010994124

Global optimization of general nonconvex problems with intermediate polynomial substructures

Zorn, Keith; Sahinidis, Nikolaos - In: Journal of Global Optimization 59 (2014) 2, pp. 673-693

="NonProportional">BARON at every node in the branch-and-bound tree. A computational study including randomly generated problems of varying size … computational time, branch-and-bound tree size, and required memory. Copyright Springer Science+Business Media New York 2014 …

Persistent link: https://www.econbiz.de/10010994125

Upper bounding in inner regions for global optimization under inequality constraints

Araya, Ignacio; Trombettoni, Gilles; Neveu, Bertrand; … - In: Journal of Global Optimization 60 (2014) 2, pp. 145-164

local minimization at several nodes/iterations of the branch and bound. We propose in this paper an alternative approach …

Persistent link: https://www.econbiz.de/10010994170

Pareto optimality and robustness in bi-blending problems

Herrera, Juan; Casado, Leocadio; Hendrix, Eligius; … - In: TOP: An Official Journal of the Spanish Society of … 22 (2014) 1, pp. 254-273

scarce raw materials. The bi-blending problem is described, and a search strategy based on Branch-and-Bound is analysed …

Persistent link: https://www.econbiz.de/10010995411

Optimizing a multi-stage production/inventory system by DC programming based approaches

Thi, Hoai Le; Tran, Duc - In: Computational Optimization and Applications 57 (2014) 2, pp. 441-468

problem. In order to globally solve the problem, we combine DCA with a Branch and Bound algorithm (BB-DCA). A convex minorant … combined DCA-Branch and Bound algorithm. We also propose a simple heuristic algorithm which is proved by experimental results …

Persistent link: https://www.econbiz.de/10010998319

An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset

Morrison, David R.; Sewell, Edward C.; Jacobson, Sheldon H. - In: European Journal of Operational Research 236 (2014) 2, pp. 403-409

The simple assembly line balancing problem (SALBP) is a well-studied NP-complete problem for which a new problem database of generated instances was published in 2013. This paper describes the application of a branch, bound, and remember (BB&R) algorithm using the cyclic best-first search...

Persistent link: https://www.econbiz.de/10010753504

First order rejection tests for multiple-objective optimization

Goldsztejn, Alexandre; Domes, Ferenc; Chevalier, Brice - In: Journal of Global Optimization 58 (2014) 4, pp. 653-672

Three rejection tests for multi-objective optimization problems based on first order optimality conditions are proposed. These tests can certify that a box does not contain any local minimizer, and thus it can be excluded from the search process. They generalize previously proposed rejection...

Persistent link: https://www.econbiz.de/10010758666

Fitting concentric circles to measurements

Drezner, Zvi; Brimberg, Jack - In: Computational Statistics 79 (2014) 1, pp. 119-133

Measurements for fitting a given number of concentric circles are recorded. For each concentric circle several measurements are taken. The problem is to fit the given number of circles to the data such that all circles have a common center. This is a generalization of the problem of fitting a...

Persistent link: https://www.econbiz.de/10010759198

On approximation of the fixed charge transportation problem

Adlakha, Veena G.; Kowalski, Krzysztof; Wang, Simi; … - In: Omega : the international journal of management science 43 (2014), pp. 64-70

Persistent link: https://www.econbiz.de/10010238215