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 Sassano A., in the category ALL
(or show them all): (Items found: 62)
2011 | 2009 | 2007 | 2004 | 1998 | 1997 | 1996 | 1995 | 1994 | 1993 | 1992 | 1990 | 1989 | 1988 | 1987 | 1986 | 1985 | 1984
2011 [top] 2009 [top] 2007 [top] 2004 [top]
- Avella P., Sara Mattia, Sassano A.: Metric Inequalities and the Network Loading Problem, in the Proceedings of IPCO X, Lecture Notes in Computer Science, 3064, pp. 16--32, 2004
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
- Anna Galluccio, Sassano A.: The rank facets of the stable set polytope for claw-free graphs, Journal of Combinatorial Theory Series B, 1-38, 1997
1996 [top]
- 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
- Lucertini M., Giovanni Rinaldi, Sassano A., Simeone B. eds.: Partitioning and Decomposition in Combinatorial Optimization, Discrete Applied Mathematics, 62, North-Holland Amsterdam, 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]
- De Simone C., Sassano A.: Stability Number of Bull and Chair Free Graphs, Discrete Applied Mathematics 41, 121-129, 1993
- Anna Galluccio, Sassano A.: The rank facets of the stable set polytope for claw-free graphs, IASI-CNR, R. 370, 12/1993
- 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]
- De Simone C., Sassano A.: Stability Number of Bull and Chair Free Graphs, Discrete Applied Mathematics, 1992
- Laurent M., Sassano A.: A characterization of knapsacks with the max-flow-min-cut property, Operations Research Letters 11 (2), 105-110, 1992
- Mannino C., Sassano A.: An exact algorithm for the maximum stable set problem., IASI-CNR, R. 334, 04/1992
- 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
- Padberg M., Sassano A.: The complexity of Matching with Bonds, Information Processing Letters, 1992
1990 [top]
- Conforti M., Rao M.R., Sassano A.: The Equipartition Polytope II: Valid Inequalities and Facets, Mathematical Programming 49 (1), 71-90, 1990
- Conforti M., Rao M.R., Sassano A.: The Equipartition Polytope I: Formulations, Dimension and Basic Facets, Mathematical Programming 49 (1), 49-70, 1990
1989 [top]
- Paola Bertolazzi, Sassano A.: A decomposition strategy for the vertex cover problem, Information Processing Letters (31), 299-304, 1989
- Cornuéjols G., Sassano A.: On the $0,1$ facets of the set-covering problem, Mathematical Programming 43, 45-55, 1989
- De Simone C., Sassano A.: Stability numbers of bull and chair free graphs., IASI-CNR, R. 258, 05/1989
- Laurent M., Sassano A.: A characterization of knapsacks with the max-flow-min-cut property., IASI-CNR, R. 276, 12/1989
- 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
- Padberg M., Giovanni Rinaldi, Sassano A. eds.: Algorithms and Discrete Optimization, Mathematical Programming, 45 (2), North-Holland Amsterdam, 1989
- Padberg M., Giovanni Rinaldi, Sassano A. eds.: Polyhedra and Discrete Optimization, Mathematical Programming, 45 (1), North-Holland Amsterdam, 1989
- Sassano A.: On the facial structure of the set-covering problem, Mathematical Programming 44, 181-202, 1989
- Sassano A.: Reducible cliques and the strong perfect graph conjecture., IASI-CNR, R. 257, 03/1989
1988 [top]
- Paola Bertolazzi, Sassano A.: A class of polynomially solvable set-covering problems, SIAM Journal on Discrete Mathematics 1 (3), 306-316, 1988
- Paola Bertolazzi, Sassano A.: A decomposition strategy for the vertex cover problem., IASI-CNR, R. 209, 02/1988
- Bianco L., Ricciardelli S., Giovanni Rinaldi, Sassano A.: Scheduling tasks with sequence dependent processing times, Naval Research Logistics Quarterly 35, 177-184, 1988
- D'Atri A., Moscarini M., Sassano A.: The Steiner Tree Problem and Homogeneous Sets, in: Mathematical Foundation of Computer Science, Chytil M.P., Janiga L., Koubek V. eds., Lecture Notes in Computer Science, 324, Springer-Verlag Berlin, 249-261, 1988
- Anna Galluccio, Sassano A.: A min-max relation for the stability number in claw-free graphs I: kite-systems., IASI-CNR, R. 235, 09/1988
- Anna Galluccio, Sassano A.: A min-max relation for the stability number in claw-free graphs II: 2-reducible graphs., IASI-CNR, R. 236, 09/1988
- Anna Galluccio, Sassano A.: An algorithm for vertex packing in claw-free graphs., IASI-CNR, R. 240, 11/1988
- Moscarini M., Sassano A.: The Steiner set problem and the greedy algorithm., IASI-CNR, R. 227, 07/1988
- 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
- Sassano A.: Minimizing Costs in Crude Oil Transportation, in: Freight Transport Planning and Logistics, Bianco L., La Bella A. eds., Springer-Verlag Berlin, 319-333, 1988
1987 [top]
- Paola Bertolazzi, Sassano A.: An O(mn) Algorithm for Regular Set-Covering Problems, Theoretical Computer Science 54, 237-247, 1987
- Bianco L., Giovanni Rinaldi, Sassano A.: A combinatorial optimization approach to aircraft sequencing problem, in: NATO ASI Series, Vol.~F38, Odoni A.R., others eds., Springer-Verlag Berlin, 323-339, 1987
- Bianco L., Giovanni Rinaldi, Sassano A.: A combinatorial optimization approach to aircraft sequencing problem., IASI-CNR, R. 182, 04/1987
- Conforti M., Rao M.R., Sassano A.: The equipartition polytope I: formulations, dimension and basic facets., IASI-CNR, R. 195, 10/1987
- Conforti M., Rao M.R., Sassano A.: The equipartition polytope II: valid inequalities and facets., IASI-CNR, R. 196, 10/1987
- D'Atri A., Moscarini M., Sassano A.: Homogeneous graphs and Steiner trees., IASI-CNR, R. 178, 01/1987
1986 [top]
- Paola Bertolazzi, Sassano A.: A class of polynomially solvable set-covering problems., IASI-CNR, R. 167, 10/1986
- Paola Bertolazzi, Sassano A.: Regular clutters., IASI-CNR, R. 169, 11/1986
- Cornuéjols G., Sassano A.: On the 0,1 facets of the set covering polytope., IASI-CNR, R. 153, 04/1986
- Padberg M., Sassano A.: The complexity of matching with bonds., IASI-CNR, R. 172, 12/1986
1985 [top] 1984 [top]
|