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

In this paper, we study the subset-sum problem by using a quantum heuristic approach similar to the verification circuit of quantum Arthur-Merlin games [1]. Under described certain assumptions, we show that the exact solution of the subset sum problem my be obtained in polynomial time and the exponential speed-up over the classical algorithms may be possible. We give a numerical example and dis...

Abstract In the knapsack problem a group of agents want to fill with several goods. Two issues must be considered. The first is decide optimally what goods select for knapsack. This issue has been studied in many papers literature on Operations Research and Management Science. second divide total revenue among agents. only few papers, this one them. For each we consider three associated coopera...

In this paper the well-known 0-1 Multiple Knapsack Problem (MKP) is approached by an adaptive Binary Differential Evolution (aBDE) algorithm. The MKP is a NP-hard optimization problem and the aim is to maximize the total profit subjected to the total weight in each knapsack that must be less than or equal to a given limit. The aBDE self adjusts two parameters, perturbation and mutation rates, u...

Binary optimization problems are in the most case the NP-hard problems that call to satisfy an objective function with or without constraints. Various optimization problems can be formulated in binary expression whither they can be resolved in easier way. Optimization literature supplies a large number of approaches to find solutions to binary hard problems. However, most population-based algor...

We are concerned with the precedence-constrained knapsack problem (PCKP), which is a knapsack problem defined on a directed acyclic graph (DAG). It is often the case that the original problem includes redundant constraints, and by eliminating these we obtain a PCKP of (much) smaller size. We show that such a reduction can be explained in terms of the ‘transitive reduction’ of the DAG associated...

The Capacitated p-median problem (CPMP) seeks to solve the optimal location of p facilities, considering distances and capacities for the service to be given by each median. In this paper we present a column generation approach to CPMP. The identified restricted master problem optimizes the covering of 1-median clusters satisfying the capacity constraints, and new columns are generated consider...