Quantum speedup of branch-and-bound algorithms [PDF]
Physical Review Research, 2020 Branch-and-bound is a widely used technique for solving combinatorial optimization problems where one has access to two procedures: a branching procedure that splits a set of potential solutions into subsets, and a cost procedure that determines a lower ...
Ashley Montanaro
doaj +5 more sources
Reconciling taxonomy and phylogenetic inference: formalism and algorithms for describing discord and inferring taxonomic roots [PDF]
Algorithms for Molecular Biology, 2012 Background Although taxonomy is often used informally to evaluate the results of phylogenetic inference and the root of phylogenetic trees, algorithmic methods to do so are lacking.
Matsen Frederick A, Gallagher Aaron
doaj +7 more sources
Template realization of generalized branch and bound algorithm
Mathematical Modelling and Analysis, 2005 In this work we consider a template for implementation of parallel branch and bound algorithms. The main aim of this package to ease implementation of covering and combinatorial optimization methods for global optimization.
M. Baravykaite +2 more
doaj +4 more sources
Node selection strategies in interval Branch and Bound algorithms [PDF]
Journal of Global Optimization, 2016 International audienceWe present in this article new strategies for selecting nodes in interval Branch and Bound algorithms for constrained global optimization.
Araya, Ignacio +2 more
core +7 more sources
Using a new algorithm to improve the search answer in quadratic assignment problem (QAP) [PDF]
International Journal of Research in Industrial Engineering, 2021 Layout design problem is one of the useful field of study used to increase the efficiency of sources in organizations. In order to achieve an appropriate layout design, it is necessary to define and solve the related nonlinear programming problems ...
Hossein Jafari, Abbas Sheykhan
doaj +1 more source
A local core number based algorithm for the maximum clique problem [PDF]
Transactions on Combinatorics, 2021 The maximum clique problem (MCP) is to determine a complete subgraph of maximum cardinality in a graph. MCP is a fundamental problem in combinatorial optimization and is noticeable for its wide range of applications.
Neda Mohammadi, Mehdi Kadivar
doaj +1 more source
The temolate for parallel branch algorithm
Lietuvos Matematikos Rinkinys, 2004 The aim of this work is to propose parallel branch and bound algorithm template. For this purpose sequential template is introduced. Implementing additional features of this template some parallel branch and bound algorithms are comstructed and analyzed
Milda Baravykaitė
doaj +3 more sources
Computing real zeros of a polynomial by branch and bound and branch and reduce algorithms [PDF]
Yugoslav Journal of Operations Research, 2014 In this paper we propose two algorithms based on branch and bound method and reduced interval techniques to compute all real zeros of a polynomial.
Le Thi Hoai An +2 more
doaj +1 more source
Processor load balancing for parallel branch and bound algorithms
Lietuvos Matematikos Rinkinys, 2005 In this atricle the development of parallel branch and bound algorithm template is presented. Attention is ocused on the dynamic load balancing module of the template.
Milda Baravykaitė
doaj +3 more sources
NK-MaxClique and MMCQ: Tow New Exact Branch and Bound Algorithms for the Maximum Clique Problem
IEEE Access, 2020 The maximum clique problem (MCP) is a fundamental problem in combinatorial optimization which finds important applications in real-word. This paper describes two new efficient branch-and-bound maximum clique algorithms NK-MaxClique and MMCQ, designed for
Neda Mohammadi, Mehdi Kadivar
doaj +1 more source