Antonio Sassano

55 papers A 1B 5C 2Journal 45Unranked 1
YearRankTypeTitle / Venue / Authors
2024 J jnl
Power Reduction in FM Networks by Mixed-Integer Programming: A Case Study.
IEEE Access
Pasquale Avella, Paolo Nobili, Antonio Sassano
2021 J jnl
An 풪(n
Math. Program.
Paolo Nobili, Antonio Sassano
2017 J jnl
An 𝒪 (m log n) algorithm for the weighted stable set problem in claw-free graphs with α(G) ≤ 3.
Math. Program.
Paolo Nobili, Antonio Sassano
2017 J jnl
GUB Covers and Power-Indexed formulations for Wireless Network Design.
CoRR
Fabio D'Andreagiovanni, Carlo Mannino, Antonio Sassano
2017 J jnl
Negative Cycle Separation in Wireless Network Design.
CoRR
Fabio D'Andreagiovanni, Carlo Mannino, Antonio Sassano
2016 J jnl
An algorithm for the weighted stable set problem in {claw, net}-free graphs with α(G)≥4.
Discret. Optim.
Paolo Nobili, Antonio Sassano
2015 J jnl
An ${\cal O}(m\log n)$ algorithm for the weighted stable set problem in claw-free graphs with $α({G}) \le 3$.
CoRR
Paolo Nobili, Antonio Sassano
2015 J jnl
An ${\cal O}(n\sqrt{m})$ algorithm for the weighted stable set problem in {claw, net}-free graphs with $α(G) \ge 4$.
CoRR
Paolo Nobili, Antonio Sassano
2015 J jnl
An ${\cal O}(n^2 \log(n))$ algorithm for the weighted stable set problem in claw-free graphs.
CoRR
Paolo Nobili, Antonio Sassano
2014 J jnl
A reduction algorithm for the weighted stable set problem in claw-free graphs.
Discret. Appl. Math.
Paolo Nobili, Antonio Sassano
2014 J jnl
The Hirsch Conjecture for the fractional stable set polytope.
Math. Program.
Carla Michini, Antonio Sassano
2013 J jnl
GUB Covers and Power-Indexed Formulations for Wireless Network Design.
Manag. Sci.
Fabio D'Andreagiovanni, Carlo Mannino, Antonio Sassano
2013 — ch.
The Shortest Walk to Watch TV.
The Power of Algorithms
Fabrizio Rossi, Antonio Sassano, Stefano Smriglio
2011 C conf
A reduction algorithm for the weighted stable set problem in claw-free graphs.
CTW
Paolo Nobili, Antonio Sassano
2011 C conf
Negative Cycle Separation in Wireless Network Design.
INOC
Fabio D'Andreagiovanni, Carlo Mannino, Antonio Sassano
2011 J jnl
Planning wireless networks by shortest path.
Comput. Optim. Appl.
Carlo Mannino, Sara Mattia, Antonio Sassano
2008 J jnl
Time offset optimization in digital broadcasting.
Discret. Appl. Math.
Carlo Mannino, Fabrizio Rossi, Antonio Sassano, Stefano Smriglio
2007 J jnl
Computational study of large-scale
Math. Program.
Pasquale Avella, Antonio Sassano, Igor Vasil'ev
2007 J jnl
Metric inequalities and the Network Loading Problem.
Discret. Optim.
Pasquale Avella, Sara Mattia, Antonio Sassano
2007 J jnl
Models and solution techniques for frequency assignment problems.
Ann. Oper. Res.
Karen I. Aardal, Stan P. M. van Hoesel, Arie M. C. A. Koster, Carlo Mannino, Antonio Sassano
2004 B conf
Metric Inequalities and the Network Loading Problem.
IPCO
Pasquale Avella, Sara Mattia, Antonio Sassano
2003 J jnl
A Complete Adaptive Algorithm for Propositional Satisfiability.
Discret. Appl. Math.
Renato Bruni, Antonio Sassano
2003 J jnl
A heuristic for large-scale p-median instances.
Electron. Notes Discret. Math.
Pasquale Avella, Antonio Sassano, Igor Vasil'ev
2003 J jnl
An Enumerative Algorithm for the Frequency Assignment Problem.
Discret. Appl. Math.
Carlo Mannino, Antonio Sassano
2003 J jnl
Models and solution techniques for frequency assignment problems.
4OR
Karen I. Aardal, Stan P. M. van Hoesel, Arie M. C. A. Koster, Carlo Mannino, Antonio Sassano
2002 J jnl
Minimizing the span of
Math. Program.
Alessandro Avenali, Carlo Mannino, Antonio Sassano
2001 B conf
Errors Detection and Correction in Large Scale Data Collecting.
IDA
Renato Bruni, Antonio Sassano
2001 J jnl
Models and Algorithms for Terrestrial Digital Broadcasting.
Ann. Oper. Res.
Fabrizio Rossi, Stefano Smriglio, Antonio Sassano
2001 J jnl
On the
Math. Program.
Pasquale Avella, Antonio Sassano
2001 J jnl
Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae.
Electron. Notes Discret. Math.
Renato Bruni, Antonio Sassano
2000 A conf
Finding Minimal Unsatisfiable Subformulae in Satisfiability Instances.
CP
Renato Bruni, Antonio Sassano
1998 J jnl
(0, +-1) ideal matrices.
Math. Program.
Paolo Nobili, Antonio Sassano
1998 J jnl
A Lagrangian-based heuristic for large-scale set covering problems.
Math. Program.
Sebastián Ceria, Paolo Nobili, Antonio Sassano
1997 J jnl
Chair-Free Berge Graphs Are Perfect.
Graphs Comb.
Antonio Sassano
1997 J jnl
The Rank Facets of the Stable Set Polytope for Claw-Free Graphs.
J. Comb. Theory B
Anna Galluccio, Antonio Sassano
1995 B conf
(0, ±1) Ideal Matrices.
IPCO
Paolo Nobili, Antonio Sassano
1995 J jnl
Preface.
Discret. Appl. Math.
Mario Lucertini, Giovanni Rinaldi, Antonio Sassano, Bruno Simeone
1995 J jnl
Solving hard set covering problems.
Oper. Res. Lett.
Carlo Mannino, Antonio Sassano
1994 J jnl
An exact algorithm for the maximum stable set problem.
Comput. Optim. Appl.
Carlo Mannino, Antonio Sassano
1993 — conf
Edge projection and the maximum cardinality stable set problem.
Cliques, Coloring, and Satisfiability
Carlo Mannino, Antonio Sassano
1993 J jnl
Polyhedral Properties of Clutter Amalgam.
SIAM J. Discret. Math.
Paolo Nobili, Antonio Sassano
1993 J jnl
Stability Number of Bull- and Chair-Free Graphs.
Discret. Appl. Math.
Caterina De Simone, Antonio Sassano
1993 J jnl
The anti-join composition and polyhedra.
Discret. Math.
Paolo Nobili, Antonio Sassano
1992 B conf
A Separation Routine for the Set Covering Polytope.
IPCO
Paolo Nobili, Antonio Sassano
1992 J jnl
A characterization of knapsacks with the max-flow- - min-cut property.
Oper. Res. Lett.
Monique Laurent, Antonio Sassano
1991 J jnl
The equipartition polytope. I: Formulations, dimension and basic facets.
Math. Program.
Michele Conforti, M. R. Rao, Antonio Sassano
1991 J jnl
The equipartition polytope. II: Valid inequalities and facets.
Math. Program.
Michele Conforti, M. R. Rao, Antonio Sassano
1989 J jnl
A Decomposition Strategy for the Vertex Cover Problem.
Inf. Process. Lett.
Paola Bertolazzi, Antonio Sassano
1989 J jnl
Facets and lifting procedures for the set covering polytope.
Math. Program.
Paolo Nobili, Antonio Sassano
1989 J jnl
On the 0, 1 facets of the set covering polytope.
Math. Program.
Gérard Cornuéjols, Antonio Sassano
1989 J jnl
On the facial structure of the set covering polytope.
Math. Program.
Antonio Sassano
1989 J jnl
The Complexity of Matching with Bonds.
Inf. Process. Lett.
Manfred Padberg, Antonio Sassano
1988 J jnl
A Class of Polynomially Solvable Set-Covering Problems.
SIAM J. Discret. Math.
Paola Bertolazzi, Antonio Sassano
1988 B conf
The Steiner Tree Problem and Homogeneous Sets.
MFCS
Alessandro D'Atri, Marina Moscarini, Antonio Sassano
1987 J jnl
An O(mn) Algorithm for Regular Set-Covering Problems.
Theor. Comput. Sci.
Paola Bertolazzi, Antonio Sassano