
 [No title] 
  The research is aimed at both the study of hypergraph properties [GLNP89,GLNP93,NPM94] and of optimization hypergraph problems such as shortest hyperpaths, minimum cuts and minimum cost hyperflows. 
  In particular, a Simplex algorithm for the Minimum Cost Flow Problem on capacitated directed hypergraphs, based on the characterization of the basis structures in terms of spanning hypertrees, has been proposed [CGS92,CGS97,GLS96]. 
  Furthermore, as it is pointed out in the Logical Inference and Optimization section, hypergraphs provide a powerful tool to model and solve a wide class of logical inference problems. 
 www.di.unipi.it /di/groups/optimize/hygraph.html (797 words) 
