Results 1 to 10 of about 15,097 (164)
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 +3 more sources
Anomalies in parallel branch-and-bound algorithms [PDF]
Communications of the ACM, 1984 We consider the effects of parallelizing branch-and-bound algorithms by expanding several live nodes simultaneously. It is shown that it is quite possible for a parallel branch-and-bound algorithm using n 2 processors to take more time than one using n 1 processors, even though n ...
Sartaj Sahni, Ten-Hwang Lai
exaly +3 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
An implementation of a parallel generalized branch and bound template
Mathematical Modelling and Analysis, 2007 Branch and bound (BnB) is a general algorithm to solve optimization problems. We present a template implementation of the BnB paradigm. A BnB template is implemented using C++ object oriented paradigm. MPI is used for underlying communications.
Milda Baravykaitė, Raimondas Čiegis
doaj +1 more source
Time-Efficient Sub-Optimal Solutions for Dynamic Spectrum Allocation in CRN With User Fairness
IEEE Access, 2021 The incredibly increasing demand for higher rates in the last decade as well as the introduction of many new applications that require wireless connectivity necessitate proper and efficient utilization of the frequency spectrum.
Ahmed Aboulfotouh, Samy S. Soliman
doaj +1 more source