It is shown in [1] that the optimal downlink radio resource allocation for non-realtime traffic in cellular CDMA/TDMA networks can be mapped to a Multi-dimensional Multiple-choice Knapsack Problem (MMKP) which is NP-hard. In this correspondence we propose a heuristic algorithm with polynomial time complexity for this problem. Numerical results indicate significant computational performance impr...

The paper addresses a new class of combinatorial problems which consist in restructuring of solutions (as structures) in combinatorial optimization. Two main features of the restructuring process are examined: (i) a cost of the restructuring, (ii) a closeness to a goal solution. This problem corresponds to redesign (improvement, upgrade) of modular systems or solutions. The restructuring approa...

0/1 Multiple Knapsack Problem, a generalization of more popular 0/1 Knapsack Problem, is NP-hard and considered harder than simple Knapsack Problem. 0/1 Multiple Knapsack Problem has many applications in disciplines related to computer science and operations research. Quantum Inspired Evolutionary Algorithms (QIEAs), a subclass of Evolutionary algorithms, are considered effective to solve diffi...

Let F3(n, m) be a random 3-SAT formula formed by selecting uniformly, independently, and with replacement, m clauses among all 8 ( y ) possible 3-clauses over n variables. It has been conjectured that there exists a constant 7-3 such that for any E > 0, F3(n, (r3 e)n) is almost surely satisfiable, but F3 (n, ( 7 3 + E).) is almost surely unsatisjiable. The best lower bounds for the potential va...

The article addresses combinatorial evolution and forecasting of communication protocol for wireless sensor networks (ZigBee). Morphological tree structure (a version of and-or tree) is used as a hierarchical model for the protocol. Three generations of ZigBee protocol are examined. A set of protocol change operations is generated and described. The change operations are used as items for forec...

The Multiple-Choice Multi-Dimension Knapsack Problem (MMKP) is a variant of the 0-1 knapsack problem, an NP-Hard problem. Due to its high computational complexity, algorithms for exact solution of the MMKPs are not suitable for most real-time decision-making applications, such as quality adaptation and admission control for interactive multimedia systems, or service level agreement (SLA) manage...

Let F3(n;m) be a random 3-SAT formula formed by selecting uniformly, independently, and with replacement, m clauses among all 8 n3 possible 3-clauses over n variables. It has been conjectured that there exists a constant r3 such that for any > 0, F3(n; (r3 )n) is almost surely satisfiable, but F3(n; (r3 + )n) is almost surely unsatisfiable. The best lower bounds for the potential value of r3 ha...

This paper considers knapsack problem with fuzzy weights, says fuzzy knapsack problem (FKP). Here we introduce possibility index which gives the possibility of choosing the items with fuzzy weights for knapsack with crisp capacity. In this paper a dynamic programming technique has been introduced to optimize the utility value of objective function. An algorithm has been proposed which gives the...

to improve the quality of the mcqs, a supervising feedback strategy between the examination constructors and the educational development office of the school of traditional medicine was performed to evaluate the content validity and designation of the course items of the phytotherapy exam for phd students of traditional pharmacy. the efforts resulted in a well-constructed examination.