After the seminal books by Martello and Toth (1990) Kellerer, Pferschy, Pisinger (2004), knapsack problems became a classical rich research area in combinatorial optimization. The purpose of this survey, which is structured two parts, to cover developments that appeared field after publication latter volume. Part I devoted whose goal optimally assign items single knapsack. Besides (binary, subs...

A new approach for identifying a friend aircrafts from foe (IFF) using public-key cryptosystem is introduced. Two schemes of public-key cryptosystem namely: RSA and knapsack public-keys are considered, which provide higher security than conventional identification methods. The practical aspects of using such systems for aircraft identification purposes are discussed. Computer simulation example...

A new approach for identifying a friend aircrafts from foe (IFF) using public-key cryptosystem is introduced. Two schemes of public-key cryptosystem namely: RSA and knapsack public-keys are considered, which provide higher security than conventional identification methods. The practical aspects of using such systems for aircraft identification purposes are discussed. Computer simulation example...

A new approach for identifying a friend aircrafts from foe (IFF) using public-key cryptosystem is introduced. Two schemes of public-key cryptosystem namely: RSA and knapsack public-keys are considered, which provide higher security than conventional identification methods. The practical aspects of using such systems for aircraft identification purposes are discussed. Computer simulation example...

A new approach for identifying a friend aircrafts from foe (IFF) using public-key cryptosystem is introduced. Two schemes of public-key cryptosystem namely: RSA and knapsack public-keys are considered, which provide higher security than conventional identification methods. The practical aspects of using such systems for aircraft identification purposes are discussed. Computer simulation example...

A new approach for identifying a friend aircrafts from foe (IFF) using public-key cryptosystem is introduced. Two schemes of public-key cryptosystem namely: RSA and knapsack public-keys are considered, which provide higher security than conventional identification methods. The practical aspects of using such systems for aircraft identification purposes are discussed. Computer simulation example...

A new approach for identifying a friend aircrafts from foe (IFF) using public-key cryptosystem is introduced. Two schemes of public-key cryptosystem namely: RSA and knapsack public-keys are considered, which provide higher security than conventional identification methods. The practical aspects of using such systems for aircraft identification purposes are discussed. Computer simulation example...

We show that there are 0-1 and unbounded knapsack polytopes with super-polynomial extension complexity. More specifically, for each n ∈ N we exhibit 0-1 and unbounded knapsack polyhedra in dimension n with extension complexity Ω(2 p n).

Formal features of semantics-related tasks of text processing are reviewed; NP-complete procedural complexity of the class is substantiated. To diminish procedural complexity, the rationale behind applied formal linguistic knowledge is demonstrated, based on the analogy of the knapsack problem and automated text abstracting. Versatile approach for text processing is proposed, considering relati...

A new approach for identifying a friend aircrafts from foe (IFF) using public-key cryptosystem is introduced. Two schemes of public-key cryptosystem namely: RSA and knapsack public-keys are considered, which provide higher security than conventional identification methods. The practical aspects of using such systems for aircraft identification purposes are discussed. Computer simulation example...