Submodularity (or concavity) is considered as an important property in the field of cooperative game theory. In this article, we characterize submodular minimum coloring games and submodular minimum vertex cover games. These characterizations immediately show that it can be decided in polynomial...

Submodularity (or concavity) is considered as an important property in the field of cooperative game theory. In this article, we characterize submodular minimum coloring games and submodular minimum vertex cover games. These characterizations immediately show that it can be decided in polynomial...

This paper provides a new approach to solving the three-dimensional packing problem. The heuristic developed uses a multi-faced buildup technique in the packing procedure for which there is no requirement for packed boxes to form flat layers. The basic algorithm is then augmented by a Look-ahead...