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 ALL
(or show them all): (Items found: 34)
2007 | 2006 | 2005 | 2004 | 2002 | 2001 | 2000 | 1999 | 1998 | 1997 | 1996 | 1995 | 1994 | 1993 | 1992 | 1991 | 1990 | 1989 | 1988
2007 [top]
- Castorini E., Nobili P., Triki C.: Optimal Routing and Resource Allocation in Ad-Hoc Networks, manuscript accepted in Optimization Methods and Software, 2007
- Leggieri V., Nobili P., Triki C.: Minimum Power Multicasting problem in Wireless Networks, manuscpript to appear in Mathematical Methods of Operations Research, 2007
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
2004 [top]
- Anna Galluccio, Nobili P.: A (1-1/2Q) - Approximation algorithm for max vertex cover in clique-coverable graphs, IASI-CNR, R. 611, 6/2004
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
2001 [top]
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
- Avis D., De Simone C., Nobili P.: On the chromatic polynomial of a graph, IASI-CNR, R. 534, 10/2000
1999 [top]
1998 [top]
- Avis D., De Simone C., Nobili P.: On the shameful conjecture, IASI-CNR, R. 481, 11/1998
- 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
1996 [top]
- De Francesco C., Nobili P.: A Characterization Of 0,?1 perfect matrices in terms of perfect graphs, IASI-CNR, R. 444, 11/1996
- Nobili P., Sassano A.: Strengthening Lagrangian bounds for the MAX-SAT problem, IASI-CNR, R. 443, 11/1996
1995 [top]
- Ceria S., Nobili P., Sassano A.: A Lagrangian-based heuristic for large-scale set covering problems, IASI-CNR, R. 406, 03/1995
- 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
1994 [top]
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
- Nobili P., Sassano A.: A separation routine for the set covering polytope., IASI-CNR, R. 333, 03/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
- Sara Nicoloso, Nobili P.: A set covering formulation of the matrix equipartition problem., IASI-CNR, R. 311, 11/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
1988 [top]
- Nobili P., Sassano A.: Facets and lifting procedures for the set covering polytope., IASI-CNR, R. 210, 03/1988
- Nobili P., Sassano A.: Polyhedral properties of clutter amalgam., IASI-CNR, R. 243, 12/1988
- Nobili P., Sassano A.: The anti-join composition and related polyhedra., IASI-CNR, R. 245, 12/1988
- Nobili P., Sassano A.: The F-propertyand the dominant of the cycle polytope for graphs noncontractible to W_4., IASI-CNR, R. 246, 12/1988
|
