We discuss four variants of the graph colouring problem, and present algorithms for solving them. The problems are k-Colourability, Max Ind k-COL, Max Val k-COL, and, finally, Max...
The Partitioning problem is a key issue in the design of Distributed Virtual Environment (DVE) systems based on a server-network architecture. This problem consist of efficiently ...
This paper deals with large-scale crew scheduling problems arising at the Dutch railway operator, Netherlands Railways (NS). We discuss several methods to partition large instances...
Erwin J. W. Abbink, Joel Van't Wout, Dennis Huisma...
In this study we focus on the integration of inventory control and vehicle routing schedules for a distribution system in which the warehouse is responsible for the replenishment ...
Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are P-complete and hence it may not be possible to design ...