Publications of Paolo Nobili

This page shows all publications that appeared in the IASI annual research reports. Authors currently affiliated with the Institute are always listed with the full name.

You can browse through them using either the links of the following line or those associated with author names.

Show all publications of the year  ALL, with author Nobili P., in the category Journal Articles (or show them all):   (Items found: 13)


2006 | 2005 | 2002 | 1998 | 1993 | 1992 | 1990 | 1989

2006  [top]
  • Anna Galluccio, Nobili P.: Improved approximation of Maximum Vertex Cover, Operations Research Letters 34, 77-84, 2006

2005  [top]
  • Anna Galluccio, Nobili P.: Improved approximation of Maximum Vertex Cover, Operations Research Letters 34, 77-84, 2005

2002  [top]

1998  [top]
  • Ceria S., Nobili P., Sassano A.: A Lagrangian-based Heuristic for Large-scale Set Covering Problems, Mathematical Programming 81, 215-228, 1998
  • Nobili P., Sassano A.: (0, $\pm$1) Ideal Matrices, Mathematical Programming 80, 265-281, 1998

1993  [top]
  • Nobili P., Sassano A.: Polyhedral Properties of Clutter Amalgam, SIAM Journal on Discrete Mathematics 6, 139-151, 1993
  • Nobili P., Sassano A.: The Anti-join Composition and Polyhedra, Discrete Mathematics 119, 141-166, 1993

1992  [top]
  • Nobili P., Sassano A.: The Anti-Join Composition and Related Polyhedra, Discrete Applied Mathematics, 1992

1990  [top]
  • Lenzerini M., Nobili P.: On the satisfiability of dependency constraints in entity-relationship schemata, Information Systems 15 (4), 453-461, 1990

1989  [top]
  • Nobili P., Sassano A.: Facets and Lifting Procedures for the Set Covering Polytope, Mathematical Programming 45, 111-137, 1989
  • Nobili P., Sassano A.: Composition Operations for Clutters and Related Polyhedra, Methods of Operations Research 62, 235-247, 1989
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -