Xu, "Greedy algorithm for the general multidimensional knapsack problem", In Ann. Oper. Res, vol. 150, pp. 17-29, 2007.Akçay, Y. , Li, H. and Xu, S.H. ( 2007 ), “ Greedy algorithm for the general multidimensional knapsack problem ”, Annals of Operations Research, Vol. 150 ...
Firstly,the concept of greedy transformation is defined according to the evolution algorithm for knapsack problem,and an effective algorithm is proposed to implement greedy transformation.Then,through the combination of this algorithm and binary particle swarm optimization with double-structure coding given ...
Method: n_last Divides the data into a specified number of groups. The algorithm finds the most equal group sizes possible, using all data points. Only the last group is able to differ in size. E.g. group sizes: 11, 11, 11, 11, 13 Method: n_rand Divides the data into a specified...
[41] proposed a generalization privacy-preserving method suitable for the scenarios of 1:M records (an individual can have multiple records) with multiple sensitive attributes. Temuujin et al. [42] developed a more efficient l-diversity algorithm for preserving privacy of dynamically published ...
Firstly we apply standard local search to a reformulation of the problem, such that a solution to the reformulation corresponds to a refutation of the original problem. Secondly we design a greedy randomised resolution algorithm that will... SD Prestwich,I Lynce - International Conference on Theory...
Gumbel-softmax optimization method builds a mixed algorithm that combines the batched version of GSO algorithm and evolutionary computation methods. The key idea is to treat the batched optimization variables—the parameters as a population, such that the evolutionary operators, e.g., substitution, ...
Our experiments show that our method diff is faster than linear in most cases, whilst using more space. The UNIX diff command is based on the greedy algorithm by Myers and Miller [11] for the unit cost function. Since their algorithm fills the values of the dynamic programming table in ...
This algorithm is constructed by applying an extended version of the greedy primal-dual (GPD) algorithm to a virtual system (with possibly negative queues). The proposed algorithm is real-time, it does not require any knowledge of the arrival rates; at any time it uses a simple rule, based...
The heuristic reduction method is one of the desirable methods for overcoming the drawbacks of the discernibility matrix approaches. Shen et al. [28], [29], [30] presented QuickReduct algorithm, which started with empty subset, and then added the most significant feature into the candidate set...
Imase and Waxman prove that the greedy algorithm is O(\log n) competitive, and shown that this bound is asymptotically tight. It is natural to consider a variant where the cost of buying is a concave function of the edge length. In this case a better result may be possible. In ...