A Branch-and-Bound Algorithm for Processing Reverse Top-k Queries Reverse Top-k queries have already attracted significant interest in research,due to numerous real-life applications such as market analysis and product pl... Y Liu,W Hu - 《Journal of Hangzhou Dianzi University》 被引量: 1发表...
An effective branch and bound algorithm is proposed for globally solving minimax linear fractional programming problem (MLFP). In this algorithm, the lower bounds are computed during the branch and bound search by solving a sequence of linear relaxation programming problems (LRP) of the problem (ML...
Given a graph whose arc traversal times vary over time, the Time‐Dependent Travelling Salesman Problem consists of finding a Hamiltonian tour of least total duration. In this paper we exploit some properties of the problem and develop a branch‐and‐bound algorithm which outperforms the state‐...
This problem is formulated as a mixed integer programme, and a branch and bound algorithm is presented for its solution. The structural properties of this programming problem are discussed, which con be used to improve the computational efficiency of our branch and bound algorithm. An illustrative ...
In this study we compare the performance of the branch and bound algorithm on the MI formulation for the TSP to other formulations. We define different branching rules using the MI formulation structure. We solve instances from the TSP library using the branch and bound algorithm on various TSP...
Summary: We propose a branch and bound algorithm to solve the multiple-choice multidimensional knapsack problem. The branch and bound tree is arranged based on the orderings in the core and navigated in a depth first manner, which while consuming low memory effectively causes the core to be exp...
This article presents a simplicial branch and duality bound algorithm for globally solving the sum of convex–convex ratios problem with nonconvex feasible region. To our knowledge, little progress has been made for globally solving this problem so far. The algorithm uses a branch and bound scheme...
We describe a branch-and-bound algorithm for solving the general version of the problem based on its image space representation. The suggested approach specifically addresses the difficulties arising in the case when the number of ratios exceeds two. The efficacy of our approach is demonstrated on ...
Summary: The sequential branch and bound algorithm is the most established method for solving mixed integer and discrete programming problems. It is based on the tree search of the possible subproblems of the original problem. There are two goals in carrying out a tree search, namely, (i) find...
Theoretically, the residual power of the branch is the smallest when the modulation signal is matched. Demodulation verdict: Based on the principle of minimum power, determine which of the signals best matches the sample signal, and select it as the optimal match channel for demodulation ...