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 Articles in Journals, Collections and Proceedings (or show them all):   (Items found: 17) 2006 | 2005 | 2002 | 2000 | 1998 | 1997 | 1995 | 1993 | 1992 | 1991 | 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] Avis D., De Simone C., Nobili P.: On the Chromatic Polynomial of a Graph, Mathematical Programming 92, 439-452, 2002 De Simone C., Gasparyan G., Nobili P.: Non-Regular Square Bipartite Designs, Linear Algebra and Its Applications 348, 63-85, 2002 Waterer H., Johnson E.L., Nobili P., Savelsbergh M.W.P.: The relation of time indexed formulations of single machine scheduling problems to the node packing problem, Mathematical Programming 93, 477-494, 2002 2000  [top] Avis D., De Simone C., Nobili P.: Two conjectures on the chromatic polynomial, in: LATIN 2000: Theoretical Informatics, Gonnet G.H., Panario D., Viola A. eds., Lecture Notes in Computer Science, 1776, Springer-Verlag, 154-162, 2000 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 1997  [top] Ceria S., Nobili P., Sassano A.: Set Covering Problem, in: Annotated Bibliographies in Combinatorial Optimization, Dell'Amico M., Maffioli F., Martello S. eds., John Wiley and Sons, Inc., 415-428, 1997 1995  [top] Nobili P., Sassano A.: (0,$\pm$1) Ideal Matrices, in the Proceedings of Integer Programming and Combinatorial Optimization - IPCO IV, Lecture Notes in Computer Science, 920, 344-359, 1995 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 1991  [top] Sara Nicoloso, Nobili P.: A Set Covering Formulation of the Matrix Equipartition Problem, in the Proceedings of 15th IFIP Conf. on System Modelling and Optimization, Kall P. ed., Lecture Notes in Control and Information Sciences, 180, Springer-Verlag, 189-198, 1991 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 - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -