From recent research on combinatorial optimization of the knapsack problem, quantum-inspired evolutionary algorithm (QEA) was proved to be better than conventional genetic algorithms. To improve the performance of the QEA, this paper proposes research issues on QEA such as a termination criterion, a Q-gate, and a two-phase scheme, for a class of numerical and combinatorial optimization problems...

Some important classical mechanisms considered in Microeconomics and Game Theory require the solution of a diÆcult optimization problem. This is true of mechanisms for combinatorial auctions, which have in recent years assumed practical importance, and in particular of the gold standard for combinatorial auctions, the Generalized Vickrey Auction (GVA). Traditional analysis of these mechanisms i...

Following the hierarchical nature of protein folding, we propose a three-stage scheme for the prediction of a protein structure from its sequence. First, the sequence is cut to fragments that are each assigned a structure. Second, the assigned structures are combinatorially assembled to form the overall 3D organization. Third, highly ranked predicted arrangements are completed and refined. This...

this article is intended to be a survey on some combinatorial topics in group theory. the bibliography at the end is neither claimed to be exhaustive, nor is it necessarily connected with a reference in the text. i include it as i see it revolves around the concepts which are discussed in the text.

A cover-free family is a well-studied combinatorial structure that has many applications in computer science and cryptography. In this paper, we propose a new public key traitor tracing scheme based on cover-free families. The new traitor tracing scheme is similar to the Boneh-Franklin scheme except that in the BonehFranklin scheme, decryption keys are derived from Reed-Solomon codes while in o...

In this paper, we consider methods whereby a subset of players in a (k, n)-threshold scheme can “repair” another player’s share in the event that their share has been lost or corrupted. This will take place without the participation of the dealer who set up the scheme. The repairing protocol should not compromise the (unconditional) security of the threshold scheme, and it should be efficient, ...

The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R. In this paper we consider a generalization of the Steiner tree problem, so called Polymatroid Steiner Problem, in which a polymatroid P = P (V ) is defined on V and the Steiner tree is required to span at least one base of P (in particular, there may be a s...

vendor selection decisions are complicated by the fact that various conflicting multi-objective factors must be considered in the decision making process. the problem of vendor selection becomes still more compli-cated with the inclusion of incremental discount pricing schedule. such hard combinatorial problems when solved using meta heuristics produce near optimal solutions. this paper propose...

Let Z be a finite set of double points in P 1 × P 1 and suppose further that X, the support of Z, is arithmetically Cohen-Macaulay (ACM). The scheme Z is rarely ACM. In this note we present an algorithm, which depends only upon a combinatorial description of X, for the bigraded Betti numbers of I Z , the defining ideal of Z.