Let F be an r-uniform hypergraph with f vertices, where f > r ≥ 3. In [12], R. Yuster posed the problem of whether there exists an algorithm which, for a given r-uniform hyper...
In this paper, a multi-period assignment problem is studied that arises as part of a weekly planning problem at mail processing and distribution centers. These facilities contain ...
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...