定界boundalgorithmbranch分支算法 Branch-and-BoundAlgorithmforReverseTop-kQueriesAkriviVlachou1,2,ChristosDoulkeridis1,3,KjetilNørvåg1andYannisKotidis41NorwegianUniversityofScienceandTechnology(NTNU),Trondheim,Norway2InstitutefortheManagementofInformationSystems,R.C.“Athena”,Athens,Greece3UniversityofPirae...
定界boundbranch算法分支algorithm Local Stability Analysis For Uncertain Nonlinear Systems Using A Branch-and-Bound Algorithm Ufuk Topcu, Andrew Packard, Peter Seiler, and Gary Balas Abstract—We propose a method to compute invariant sub- sets of the region-of-attraction for the asymptotically stable...
In this subsection, we first overview the general branch-and-bound algorithm and the two most crucial branching algorithms in branch-and-bound, including branching variable selection and node selection. Then, we introduce the cutting plane, which is part of the branch-and-cut method. Overview of...
Our experimental evaluation demonstrates the efficiency of the proposed algorithm that outperforms RTA by a large margin. 展开 关键词: branch-and-bound algorithm reverse top-k query DOI: 10.1145/2463676.2465278 被引量: 79 年份: 2013 收藏 引用 批量引用 报错 分享 ...
In this paper, we propose a new branch and bound algorithm for the solution of large scale separable concave programming problems. The largest distance bisection (LDB) technique is proposed to divide rectangle into sub-rectangles when one problem is branched into two subproblems. It is proved ...
We propose a new branch and bound algorithm and new expressions for known lower bounds for this problem. Empirical results with a collection of previously reported instances indicate that the proposed algorithm compares favourably to previous methods. 展开 ...
j belongs to a considered site; A is the required size (in numbers of cells) of the desired site; Cik,j is the value of siting factor k for cell i, j; p is the number of considered factors; and Gk is the lower bound of the sum of factor values of cells in a site for siting...
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 ...
Furthermore, a branch and bound algorithm is developed for solving such single-machine scheduling problems. The reductions can be used to construct test problems for this algorithm. Computational results for randomly generated single-machine problems and for shop scheduling problems (without time-lags)...
This paper describes a branch and bound algorithm which can solve assembly line balancing probems with nine modifications to the originally formulated problem of minimizing the required number of assembly stations, given a cycle time, a set of tasks with given deterministic performance times, and bet...