Design combinatorial theory for test-case generation has been used successfully in the past. It is useful in optimizing test cases as it is practically impossible to exhaustively test any software system. The same concept can be applied while doing high level architecture analysis of a software system. In software architecture analysis, the architect often analyzes different scenarios that a sy...

The design of revenue-maximizing combinatorial auctions, i.e. multi-item auctions over bundles of goods, is one of the most fundamental problems in computational economics, unsolved even for two bidders and two items for sale. In the traditional economic models, it is assumed that the bidders’ valuations are drawn from an underlying distribution and that the auction designer has perfect knowled...

A problem concerning packet switched networks leads to a natural combinatorial design problem, whose solution involves (k; n)-arcs in projective planes, 3-dimensional linear codes, the theory of fractional matchings and designs which approximate projective planes.

In this paper a general bottleneck combinatorial optimization problem with uncertain element weights modeled by fuzzy intervals is considered. A rigorous possibilistic formalization of the problem and solution concepts in this setting that lead to finding robust solutions under fuzzy weights are given. Some algorithms for finding a solution according to the introduced concepts and evaluating op...