Operations Research Methods and Applications

The group mainly focuses on discrete linear programming, either to develop on general-purpose algorithms for integer programming, or to study special models of wide interest such as packing and set packing problems. The former category includes the cutting stock problem (finding the most efficient way for cutting small pieces from large ones so as to cover a prescribed demand). The latter, the clique problem (finding the largest complete subgraph of an undirected graph).

This research envisages the solution of computational challenges with advanced algorithms (e.g., problems derived from Steiner's Triple systems), and to this aim the availability of state-of-the-art laboratories is a critical issue. The Department of Computer Science/Engineering and Mathematics and the Fondazione CaRispAq recently co-funded a parallel computer laboratory, available among others to the OIL group for large scale computation. The group also maintains a dedicated laboratory (OIL lab).

The group maintains a steady cooperation with worldwide important academic institutes, such as Universidad de Buenos Aires (Argentina), Université Libre de Bruxelles (Belgium), Bilkent University (Turkey), IASI-CNR (Italy), University of Lancaster (UK), University of Lehigh (USA), University of Wisconsin-Madison (USA), Fondazione U. Bordoni (Italy).

  • During its activity the group has collected international awards, among which:
  • EURO Excellence in Practice Award: finalist 2006

Eighth INFORMS Rothkopf ranking 2008: first in Europe for visibility, second in Europe for scientific yield. The group also directly cooperates with industry on such applications of OR-MS as

  • Telecommunication and networking (frequency/power assignment)
  • Manufacturing, transportation and logistics (location, scheduling, cutting/packing, vehicle routing)
  • Manpower and service systems (rostering, shift scheduling)
  • Computer systems (re-hosting, optimal system update)