Antonio Sassano

IEEE Access, 2024

2021

An 풪(n2 log n) algorithm for the weighted stable set problem in claw-free graphs.

[BibT_eX]

[DOI]

Math. Program., 2021

2017

An 𝒪 (m log n) algorithm for the weighted stable set problem in claw-free graphs with α(G) ≤ 3.

[BibT_eX]

[DOI]

Math. Program., 2017

2016

An algorithm for the weighted stable set problem in {claw, net}-free graphs with α(G)≥4.

[BibT_eX]

[DOI]

Discret. Optim., 2016

2015

An ${\cal O}(n\sqrt{m})$ algorithm for the weighted stable set problem in {claw, net}-free graphs with $α(G) \ge 4$.

[BibT_eX]

[DOI]

CoRR, 2015

An ${\cal O}(n^2 \log(n))$ algorithm for the weighted stable set problem in claw-free graphs.

[BibT_eX]

[DOI]

CoRR, 2015

An ${\cal O}(m\log n)$ algorithm for the weighted stable set problem in claw-free graphs with $α({G}) \le 3$.

[BibT_eX]

[DOI]

CoRR, 2015

2014

The Hirsch Conjecture for the fractional stable set polytope.

[BibT_eX]

[DOI]

Carla Michini

Math. Program., 2014

A reduction algorithm for the weighted stable set problem in claw-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

2013

GUB Covers and Power-Indexed Formulations for Wireless Network Design.

[BibT_eX]

[DOI]

Fabio D'Andreagiovanni

Manag. Sci., 2013

The Shortest Walk to Watch TV.

[BibT_eX]

[DOI]

Fabrizio Rossi

Stefano Smriglio

Proceedings of the Power of Algorithms - Inspiration and Examples in Everyday Life, 2013

2011

Planning wireless networks by shortest path.

[BibT_eX]

[DOI]

Sara Mattia

Comput. Optim. Appl., 2011

Negative Cycle Separation in Wireless Network Design.

[BibT_eX]

[DOI]

Fabio D'Andreagiovanni

Proceedings of the Network Optimization - 5th International Conference, 2011

2008

Time offset optimization in digital broadcasting.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

2007

Computational study of large-scale p -Median problems.

[BibT_eX]

[DOI]

Igor Vasil'ev

Math. Program., 2007

Metric inequalities and the Network Loading Problem.

[BibT_eX]

[DOI]

Sara Mattia

Discret. Optim., 2007

Models and solution techniques for frequency assignment problems.

[BibT_eX]

[DOI]

Karen I. Aardal

Stan P. M. van Hoesel

Arie M. C. A. Koster

Ann. Oper. Res., 2007

2003

A heuristic for large-scale p-median instances.

[BibT_eX]

[DOI]

Igor Vasil'ev

Electron. Notes Discret. Math., 2003

An Enumerative Algorithm for the Frequency Assignment Problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

A Complete Adaptive Algorithm for Propositional Satisfiability.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

2002

Minimizing the span of d -walks to compute optimum frequency assignments.

[BibT_eX]

[DOI]

Alessandro Avenali

Math. Program., 2002

2001

On the p -Median polytope.

[BibT_eX]

[DOI]

Math. Program., 2001

Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Models and Algorithms for Terrestrial Digital Broadcasting.

[BibT_eX]

[DOI]

Fabrizio Rossi

Stefano Smriglio

Ann. Oper. Res., 2001

Errors Detection and Correction in Large Scale Data Collecting.

[BibT_eX]

[DOI]

Proceedings of the Advances in Intelligent Data Analysis, 4th International Conference, 2001

2000

Finding Minimal Unsatisfiable Subformulae in Satisfiability Instances.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2000

1998

(0, +-1) ideal matrices.

[BibT_eX]

[DOI]

Math. Program., 1998

A Lagrangian-based heuristic for large-scale set covering problems.

[BibT_eX]

[DOI]

Sebastián Ceria

Math. Program., 1998

1997

The Rank Facets of the Stable Set Polytope for Claw-Free Graphs.

[BibT_eX]

[DOI]

Anna Galluccio

J. Comb. Theory, Ser. B, 1997

Chair-Free Berge Graphs Are Perfect.

[BibT_eX]

[DOI]

Graphs Comb., 1997

1995

Solving hard set covering problems.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1995

Preface.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1995

1994

An exact algorithm for the maximum stable set problem.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 1994

1993

Polyhedral Properties of Clutter Amalgam.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1993

The anti-join composition and polyhedra.

[BibT_eX]

[DOI]

Discret. Math., 1993

Stability Number of Bull- and Chair-Free Graphs.

[BibT_eX]

[DOI]

Caterina De Simone

Discret. Appl. Math., 1993

Edge projection and the maximum cardinality stable set problem.

[BibT_eX]

[DOI]

Proceedings of the Cliques, 1993

1992

A characterization of knapsacks with the max-flow- - min-cut property.

[BibT_eX]

[DOI]

Monique Laurent

Oper. Res. Lett., 1992

A Separation Routine for the Set Covering Polytope.

[BibT_eX]

Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

1991

The equipartition polytope. II: Valid inequalities and facets.

[BibT_eX]

[DOI]

Michele Conforti

M. R. Rao

Math. Program., 1991

The equipartition polytope. I: Formulations, dimension and basic facets.

[BibT_eX]

[DOI]

Michele Conforti

M. R. Rao

Math. Program., 1991

1989

On the facial structure of the set covering polytope.

[BibT_eX]

[DOI]

Math. Program., 1989

Facets and lifting procedures for the set covering polytope.

[BibT_eX]

[DOI]

Math. Program., 1989

On the 0, 1 facets of the set covering polytope.

[BibT_eX]

[DOI]

Gérard Cornuéjols

Math. Program., 1989

The Complexity of Matching with Bonds.

[BibT_eX]

[DOI]

Manfred Padberg

Inf. Process. Lett., 1989

A Decomposition Strategy for the Vertex Cover Problem.

[BibT_eX]

[DOI]

Paola Bertolazzi

Inf. Process. Lett., 1989

1988

A Class of Polynomially Solvable Set-Covering Problems.

[BibT_eX]

[DOI]

Paola Bertolazzi

SIAM J. Discret. Math., 1988

The Steiner Tree Problem and Homogeneous Sets.

[BibT_eX]

[DOI]

Alessandro D'Atri

Marina Moscarini

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

1987

An O(mn) Algorithm for Regular Set-Covering Problems.

[BibT_eX]

[DOI]

Paola Bertolazzi