Computational study of large-scale *p*-Median problemsP Avella, A Sassano, I Vasil'Ev Mathematical Programming 109, 89-114, 2007 | 288 | 2007 |

An aggregation heuristic for large scale p-median problem P Avella, M Boccia, S Salerno, I Vasilyev Computers & Operations Research 39 (7), 1625-1632, 2012 | 110 | 2012 |

A computational study of a cutting plane algorithm for university course timetabling P Avella, I Vasil'Ev Journal of Scheduling 8 (6), 497-514, 2005 | 88 | 2005 |

A computational study of exact knapsack separation for the generalized assignment problem P Avella, M Boccia, I Vasilyev Computational Optimization and Applications 45, 543-555, 2010 | 76 | 2010 |

An effective heuristic for large-scale capacitated facility location problems P Avella, M Boccia, A Sforza, I Vasil’ev Journal of Heuristics 15, 597-615, 2009 | 68 | 2009 |

A computational study of local search algorithms for Italian high-school timetabling P Avella, B D’Auria, S Salerno, I Vasil’ev Journal of Heuristics 13, 543-556, 2007 | 62 | 2007 |

Near-optimal large-scale k-medoids clustering AV Ushakov, I Vasilyev Information Sciences 545, 344-362, 2021 | 61 | 2021 |

A Cut and Branch Approach for the Capacitated *p*-Median Problem Based on Fenchel Cutting PlanesM Boccia, A Sforza, C Sterle, I Vasilyev Journal of mathematical modelling and algorithms 7, 43-58, 2008 | 54 | 2008 |

The branch and cut method for the facility location problem with client’s preferences IL Vasilyev, KB Klimentova Journal of Applied and Industrial Mathematics 4, 441-454, 2010 | 52 | 2010 |

New lower bounds for the facility location problem with clients’ preferences IL Vasil’ev, KB Klimentova, YA Kochetov Computational Mathematics and Mathematical Physics 49, 1010-1020, 2009 | 47 | 2009 |

The dispatching problem on multitrack territories: Heuristic approaches based on mixed integer linear programming M Boccia, C Mannino, I Vasilyev Networks 62 (4), 315-326, 2013 | 44 | 2013 |

Time-indexed formulations for the runway scheduling problem P Avella, M Boccia, C Mannino, I Vasilyev Transportation Science 51 (4), 1196-1209, 2017 | 42 | 2017 |

Computational experience with general cutting planes for the set covering problem P Avella, M Boccia, I Vasilyev Operations Research Letters 37 (1), 16-20, 2009 | 31 | 2009 |

Polyhedral study of simple plant location problem with order I Vasilyev, X Klimentova, M Boccia Operations Research Letters 41 (2), 153-158, 2013 | 26 | 2013 |

A computational study of a nonlinear minsum facility location problem E Carrizosa, A Ushakov, I Vasilyev Computers & Operations Research 39 (11), 2625-2633, 2012 | 26 | 2012 |

Threshold robustness in discrete facility location problems: a bi-objective approach E Carrizosa, A Ushakov, I Vasilyev Optimization Letters 9 (7), 1297-1314, 2015 | 24 | 2015 |

A decomposition approach for a very large scale optimal diversity management problem P Avella, M Boccia, C Di Martino, G Oliviero, A Sforza, I Vasil’ev 4OR 3, 23-37, 2005 | 23 | 2005 |

A branch-and-cut algorithm for the multilevel generalized assignment problem P Avella, M Boccia, I Vasilyev IEEE Access 1, 475-479, 2013 | 22 | 2013 |

A branch-and-cut algorithm for the median-path problem P Avella, M Boccia, A Sforza, I Vasil'Ev Computational Optimization and Applications 32, 215-230, 2005 | 22 | 2005 |

Íîâûå íèæíèå îöåíêè äëÿ çàäà÷è ðàçìåùåíèÿ ñ ïðåäïî÷òåíèÿìè êëèåíòîâ ÈË Âàñèëüåâ, ÊÁ Êëèìåíòîâà, ÞÀ Êî÷åòîâ Æóðíàë âû÷èñëèòåëüíîé ìàòåìàòèêè è ìàòåìàòè÷åñêîé ôèçèêè 49 (6), 1055-1066, 2009 | 21 | 2009 |