The multidimensional multi-choice knapsack problem (MMKP) is one of the most complex members of the Knapsack Problem (KP) family. It has been used to model large problems such as telecommunications, quality of service (QoS), management problem in computer networks and admission control problem in the adaptive multimedia systems. In this paper, we propose a new approach based on strategic oscill...

We describe a tabu search (TS) approach for solving general zero-one mixed integer programming (MIP) problems that exploits the extreme point property of zero-one solutions. Specialized choice rules and aspiration criteria are identified for the problems, expressed as functions of integer infeasibility measures and objective function values. The first-level TS mechanisms are then extended with ...

25 CRITICAL EVENT TABU SEARCH FOR MULTIDIMENSIONAL KNAPSACK PROBLEMS Fred Glover Graduate School of Business, Box 419 University of Colorado at Boulder Boulder, Colorado, 80309-0419 E-Mail: [email protected] Gary A. Kochenberger College of Business University of Colorado at Denver Denver, Colorado 80217-3364 E-Mail: [email protected] We report a new approach to creating a ...

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...

This paper considers Web content adaptation with a bandwidth constraint for server-based adaptive Web systems. The problem can be stated as follows: Given a Web page P consisting of n component items d1, d2, . . . ,dn and each of the component items di having Ji versions di1 ; di2 ; . . . ; diJi , for each component item di select one of its versions to compose the Web page such that the fideli...

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...

At SAC '97, Itoh, Okamoto and Mambo presented a fast public key cryptosystem. After analyzing several attacks including lattice-reduction attacks, they claimed that its security was high, although the cryptosystem had some resemblances with the former knapsack cryp-tosystems, since decryption could be viewed as a multiplicative knapsack problem. In this paper, we show how to recover the private...

Knapsack public-key encryption schemes are based on the knapsack problem, which is NP-complete. Merkle-Hellman knapsack encryption scheme was the first concrete realization of a public-key encryption scheme. As its secure basis is superincreasing knapsack problem, it has been demonstrated to be insecure. Many variations have subsequently been proposed, whose knapsack vector density are less tha...