A Lagrangian-based heuristic for large-scale set covering problems S Ceria, P Nobili, A Sassano Mathematical Programming 81 (2), 215-228, 1998 | 229 | 1998 |

On the satisfiability of dependency constraints in entity-relationship schemata M Lenzerini, P Nobili Information Systems 15 (4), 453-461, 1990 | 168 | 1990 |

Annotated bibliographies in combinatorial optimization M Dell'Amico, F Maffioli, S Martello Wiley, 1997 | 160 | 1997 |

Facets and lifting procedures for the set covering polytope P Nobili, A Sassano Mathematical Programming 45 (1), 111-137, 1989 | 59 | 1989 |

Minimum power multicasting problem in wireless networks V Leggieri, P Nobili, C Triki Mathematical Methods of Operations Research 68 (2), 295-311, 2008 | 30 | 2008 |

The relation of time indexed formulations of single machine scheduling problems to the node packing problem H Waterer, EL Johnson, P Nobili, MWP Savelsbergh Mathematical Programming 93 (3), 477-494, 2002 | 29 | 2002 |

A separation routine for the set covering polytope P Nobili, A Sassano Consiglio Nazionale delle Ricerche. Istituto di Analisi dei Sistemi ed …, 1992 | 26 | 1992 |

Set Covering Problem. Annotated bibliographies in combinatorial optimization. M S Ceria, P Nobili, A Sassano, M Dell’Amico, F Maffioli, S Martello Wiley, 1997 | 20 | 1997 |

(0,±1) ideal matrices P Nobili, A Sassano Mathematical programming 80 (3), 265-281, 1998 | 15 | 1998 |

An O(n2logn) algorithm for the weighted stable set problem in claw-free graphs P Nobili, A Sassano Mathematical Programming, 1-29, 2020 | 14* | 2020 |

A reduction algorithm for the weighted stable set problem in claw-free graphs P Nobili, A Sassano Discrete Applied Mathematics 165, 245-262, 2014 | 12 | 2014 |

Energy consumption minimization in railway planning T Montrone, P Pellegrini, P Nobili, G Longo 2016 IEEE 16th International Conference on Environment and Electrical …, 2016 | 11 | 2016 |

Polyhedral properties of clutter amalgam P Nobili, A Sassano SIAM Journal on Discrete Mathematics 6 (1), 139-151, 1993 | 11 | 1993 |

Improved approximation of maximum vertex cover A Galluccio, P Nobili Operations Research Letters 34 (1), 77-84, 2006 | 10 | 2006 |

Optimal routing and resource allocation in multi-hop wireless networks E Castorini, P Nobili, C Triki Optimization Methods & Software 23 (4), 593-608, 2008 | 6 | 2008 |

Strengthening lagrangian bounds for the MAX-SAT problem P Nobili, A Sassano Consiglio Nazionale delle Ricerche. Istituto di Analisi dei Sistemi ed …, 1996 | 5 | 1996 |

A set covering formulation of the matrix equipartition problem S Nicoloso, P Nobili System Modelling and Optimization, 189-198, 1992 | 5 | 1992 |

A MILP Algorithm for the Minimization of Train Delay and Energy Consumption T Montrone, P Pellegrini, P Nobili International Conference on Optimization and Decision Science, 485-493, 2017 | 4 | 2017 |

Polynomial time recognition of essential graphs having stability number equal to matching number R Mosca, P Nobili Graphs and Combinatorics 31 (5), 1649-1658, 2015 | 4 | 2015 |

Some valid inequalities for the probabilistic minimum power multicasting problem J Barta, V Leggieri, R Montemanni, P Nobili, C Triki Electronic Notes in Discrete Mathematics 36, 463-470, 2010 | 4 | 2010 |