The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-O...
Domain mismatch and schema mismatch are two of the important semantic integration problems for interoperating heterogeneous databases. This paper structures the domain mismatch pr...
Abstract. The subset sum problem over finite fields is a well known NPcomplete problem. It arises naturally from decoding generalized Reed-Solomon codes. In this paper, we study th...
In this paper, we study the minimum spanning tree problem for vertex-labeled graphs, where the weights of edges may vary depending on the selection of labels of vertices at both e...
In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a...