In this paper we survey the basic features of state-of-the-art branch-and-cut algorithms for the solution of general mixed integer programming problems. In particular we focus on p...
This is a summary of the main results presented in the author's PhD thesis, supervised by D. Conforti and P. Beraldi and defended on March 2005. The thesis, written in English...
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
A parametric form of tabu-search is proposed for solving mixed integer programming (MIP) problems that creates and solves a series of linear programming (LP) problems embodying br...
Fuzzy Description Logics (fuzzy DLs) have been proposed as a language to describe structured knowledge with vague concepts. In [23], a solution based on Mixed Integer Linear Progr...