2008 |
29 | EE | Carlo Mannino,
Fabrizio Rossi,
Antonio Sassano,
Stefano Smriglio:
Time offset optimization in digital broadcasting.
Discrete Applied Mathematics 156(3): 339-351 (2008) |
2007 |
28 | EE | Karen Aardal,
Stan P. M. van Hoesel,
Arie M. C. A. Koster,
Carlo Mannino,
Antonio Sassano:
Models and solution techniques for frequency assignment problems.
Annals OR 153(1): 79-129 (2007) |
27 | EE | Pasquale Avella,
Sara Mattia,
Antonio Sassano:
Metric inequalities and the Network Loading Problem.
Discrete Optimization 4(1): 103-114 (2007) |
26 | EE | Pasquale Avella,
Antonio Sassano,
Igor Vasil'ev:
Computational study of large-scale p -Median problems.
Math. Program. 109(1): 89-114 (2007) |
2004 |
25 | EE | Pasquale Avella,
Sara Mattia,
Antonio Sassano:
Metric Inequalities and the Network Loading Problem.
IPCO 2004: 16-32 |
2003 |
24 | EE | Karen Aardal,
Stan P. M. van Hoesel,
Arie M. C. A. Koster,
Carlo Mannino,
Antonio Sassano:
Models and solution techniques for frequency assignment problems.
4OR 1(4): 261-317 (2003) |
23 | EE | Renato Bruni,
Antonio Sassano:
A Complete Adaptive Algorithm for Propositional Satisfiability.
Discrete Applied Mathematics 127(3): 523-534 (2003) |
22 | EE | Carlo Mannino,
Antonio Sassano:
An Enumerative Algorithm for the Frequency Assignment Problem.
Discrete Applied Mathematics 129(1): 155-169 (2003) |
21 | EE | Pasquale Avella,
Antonio Sassano,
Igor Vasil'ev:
A heuristic for large-scale p-median instances.
Electronic Notes in Discrete Mathematics 13: 14-17 (2003) |
2001 |
20 | EE | Renato Bruni,
Antonio Sassano:
Errors Detection and Correction in Large Scale Data Collecting.
IDA 2001: 84-94 |
19 | EE | Fabrizio Rossi,
Stefano Smriglio,
Antonio Sassano:
Models and Algorithms for Terrestrial Digital Broadcasting.
Annals OR 107(1-4): 267-283 (2001) |
18 | EE | Renato Bruni,
Antonio Sassano:
Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae.
Electronic Notes in Discrete Mathematics 9: 162-173 (2001) |
2000 |
17 | EE | Renato Bruni,
Antonio Sassano:
Finding Minimal Unsatisfiable Subformulae in Satisfiability Instances.
CP 2000: 495-499 |
1998 |
16 | | Paolo Nobili,
Antonio Sassano:
(0, +-1) ideal matrices.
Math. Program. 80: 265-281 (1998) |
15 | | Sebastián Ceria,
Paolo Nobili,
Antonio Sassano:
A Lagrangian-based heuristic for large-scale set covering problems.
Math. Program. 81: 215-228 (1998) |
1997 |
14 | EE | Anna Galluccio,
Antonio Sassano:
The Rank Facets of the Stable Set Polytope for Claw-Free Graphs.
J. Comb. Theory, Ser. B 69(1): 1-38 (1997) |
1995 |
13 | | Paolo Nobili,
Antonio Sassano:
(0, ±1) Ideal Matrices.
IPCO 1995: 344-359 |
12 | EE | Mario Lucertini,
Giovanni Rinaldi,
Antonio Sassano,
Bruno Simeone:
Preface.
Discrete Applied Mathematics 62(1-3): 1-3 (1995) |
1993 |
11 | EE | Caterina De Simone,
Antonio Sassano:
Stability Number of Bull- and Chair-Free Graphs.
Discrete Applied Mathematics 41(2): 121-129 (1993) |
10 | EE | Paolo Nobili,
Antonio Sassano:
The anti-join composition and polyhedra.
Discrete Mathematics 119(1-3): 141-166 (1993) |
9 | | Paolo Nobili,
Antonio Sassano:
Polyhedral Properties of Clutter Amalgam.
SIAM J. Discrete Math. 6(1): 139-151 (1993) |
1992 |
8 | | Paolo Nobili,
Antonio Sassano:
A Separation Routine for the Set Covering Polytope.
IPCO 1992: 201-219 |
1991 |
7 | | Michele Conforti,
M. R. Rao,
Antonio Sassano:
The equipartition polytope. I: Formulations, dimension and basic facets.
Math. Program. 49: 49-70 (1991) |
6 | | Michele Conforti,
M. R. Rao,
Antonio Sassano:
The equipartition polytope. II: Valid inequalities and facets.
Math. Program. 49: 71-90 (1991) |
1989 |
5 | | Paola Bertolazzi,
Antonio Sassano:
A Decomposition Strategy for the Vertex Cover Problem.
Inf. Process. Lett. 31(6): 299-304 (1989) |
4 | | Manfred Padberg,
Antonio Sassano:
The Complexity of Matching with Bonds.
Inf. Process. Lett. 32(6): 297-300 (1989) |
1988 |
3 | | Alessandro D'Atri,
Marina Moscarini,
Antonio Sassano:
The Steiner Tree Problem and Homogeneous Sets.
MFCS 1988: 249-261 |
2 | | Paola Bertolazzi,
Antonio Sassano:
A Class of Polynomially Solvable Set-Covering Problems.
SIAM J. Discrete Math. 1(3): 306-316 (1988) |
1987 |
1 | | Paola Bertolazzi,
Antonio Sassano:
An O(mn) Algorithm for Regular Set-Covering Problems.
Theor. Comput. Sci. 54: 237-247 (1987) |