In this paper we present the Selective Graph Coloring Problem, a generalization of the standard graph coloring problem as well as several of its possible applications. Given a graph with a partition of its vertex set into several clusters, we want to select one vertex per cluster such that the...

We consider a continuous time–cost tradeoff problem with multiple milestones and completely ordered jobs. If a milestone is tardy, a penalty cost may be imposed. The processing times of jobs can be compressed by additional resources or activities that incur compression costs. The objective is...

In one of the most influential existence theorems in mathematics, John F. Nash proved in 1950 that any normal form game has an equilibrium. More than five decades later, it was shown that the computational task of finding such an equilibrium is intractable, that is, unlikely to be carried out...