A. Žilinskas

Andreas Grothey

J. Žilinskas

Julius Žilinskas

M. Baravykaitė

M. Dür

M. D’Apuzzo

P. Hansen

R. Horst

R. Paulavičius

Remigijus Paulavičius

T. Csendes

V. Kreinovich

Y.D. Sergeyev

Speed and memory requirements of branch and bound algorithms depend on the selection strategy of which candidate node to process next. The goal of this paper is to experimentally investigate this influence to the performance of sequential and parallel branch and bound algorithms. The experiments have been performed solving a number of multidimensional test problems for global optimization. Branch and bound algorithm using simplicial partitions and combination of Lipschitz bounds has been investigated. Similar results may be expected for other branch and bound algorithms.</p

Paulavicius, Remigijus

Zilinskas, Julius

Grothey, Andreas

Edinburgh Research Explorer

Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds

Crossref

https://www.pure.ed.ac.uk/ws/files/9144273/Investigation_of_selection_strategies_in_branch_and_bound_algorithm_with_simplicial_partitions_and_combination_of_Lipschitz_bounds.pdf

Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds

Abstract

Similar works

Full text

Available Versions

Edinburgh Research Explorer

Crossref