Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and th...
We discuss tournaments in terms of their efficiency as probabilistic mechanisms that select high-quality alternatives ("players") in a noisy environment. We use two crit...
This paper investigates the integration of the employee timetabling and production scheduling problems. At the first level, we manage a classical employee timetabling problem. At ...
We study a network airline revenue management problem with discrete customer choice behavior. We discuss a choice model based on the concept of preference orders, in which custome...
We study a firm that makes new products in the first period and uses returned cores to make remanufactured products (along with new products) in future periods. The remanufactured...