Special Issue: “Combinatorial Optimization: Theory of Algorithms and Complexity”

Algorithms and Complexity in Combinatorial Optimization Games

We introduce an integer programming formulation for a class of combinatorial optimization games, which includes many interesting problems on graphs. We prove a simple (but very useful) theorem that the core, an important solution concept in cooperative game theory that no subset of players should be able to gain advantage by breaking away from the collective decision of all playerss40, 45], is ...

Combinatorial Auctions: Complexity and Algorithms

A combinatorial auction allows bidders to submit bids on bundles of objects and can be considered the pivotal example of a multiple object auctions. They also constitute a paradigmatic problem in algorithmic mechanism design. We provide an overview of both the computational complexity and strategic complexity inherent in the design of such auctions, and discuss how these challenges are addresse...

Special Issue on Ant Algorithms

Special Issue on Parallel Architectures and Algorithms

The International Conference on Parallel Processing is an outgrowth of the Sagamore Computer Conference on Parallel Processing. The first Sagamore Conference was held in 1972. The name of the conference was changed, in 1975, to The International Conference on Parallel Processing. Thus, 1987 was the 16th year for the conference. In the 16 years since its inception, the conference has grown consi...

Special Issue on Statistical Algorithms and Software

The journal of Computational Statistics and Data Analysis (CSDA) regularly publishes papers with a strong algorithmic and software component. Some recent CSDA related articles can be found in Bustos and Frery (2006), Hammill and Preisser (2006), Keeling and Pavur (2007), Novikov and Oberman (2007), Rosenthal (2007) and Tomasi and Bro (2006). This is the first CSDA special issue on Statistical A...