A heuristic for large-scale p-median instances. - Pasquale Avella; Antonio Sassano; Igor Vasil'ev (Electron. Notes Discret. Math., 2003)

A Grid-Aware Branch, Cut and Price Implementation. - Emilio Mancini; Sonya Marcarelli; Pierluigi Ritrovato; Igor Vasil'ev; Umberto Villano (PVM/MPI, 2005)

A decomposition approach for a very large scale optimal diversity management problem. - Pasquale Avella; Maurizio Boccia; Carmine Di Martino; Giuseppe Oliviero; Antonio Sforza; Igor Vasil'ev (4OR, 2005)

A Branch-and-Cut Algorithm for the Median-Path Problem. - Pasquale Avella; Maurizio Boccia; Antonio Sforza; Igor Vasil'ev (Comput. Optim. Appl., 2005)

A Computational Study of a Cutting Plane Algorithm for University Course Timetabling. - Pasquale Avella; Igor Vasil'ev (J. Sched., 2005)

A computational study of local search algorithms for Italian high-school timetabling. - Pasquale Avella; Bernardo D'Auria; Saverio Salerno; Igor Vasil'ev (J. Heuristics, 2007)

Computational study of large-scale p -Median problems. - Pasquale Avella; Antonio Sassano; Igor Vasil'ev (Math. Program., 2007)

Automatic defects classification with p-median clustering technique. - Denis N. Sidorov; Wong Soon Wei; Igor Vasil'ev; Saverio Salerno (ICARCV, 2008)

A grid-aware MIP solver: Implementation and case studies. - Emilio Pasquale Mancini; Sonya Marcarelli; Igor Vasil'ev; Umberto Villano (Future Gener. Comput. Syst., 2008)

A Cut and Branch Approach for the Capacitated p-Median Problem Based on Fenchel Cutting Planes. - Maurizio Boccia; Antonio Sforza; Claudio Sterle; Igor Vasil'ev (J. Math. Model. Algorithms, 2008)

An effective heuristic for large-scale capacitated facility location problems. - Pasquale Avella; Maurizio Boccia; Antonio Sforza; Igor Vasil'ev (J. Heuristics, 2009)

Computational experience with general cutting planes for the Set Covering problem. - Pasquale Avella; Maurizio Boccia; Igor Vasil'ev (Oper. Res. Lett., 2009)

A computational study of exact knapsack separation for the generalized assignment problem. - Pasquale Avella; Maurizio Boccia; Igor Vasilyev (Comput. Optim. Appl., 2010)

A parallel subgradient algorithm for Lagrangean dual function of the p-median problem. - Saïd Hanafi; Claudio Sterle; Anton V. Ushakov; Igor Vasilyev (Stud. Inform. Univ., 2011)

Preface: Baikal Conference on Optimization Methods and Their Applications. - Ider Tseveendorj; Igor Vasilyev (Stud. Inform. Univ., 2011)

An aggregation heuristic for large scale p-median problem. - Pasquale Avella; Maurizio Boccia; Saverio Salerno; Igor Vasilyev (Comput. Oper. Res., 2012)

A computational study of a nonlinear minsum facility location problem. - Emilio Carrizosa; Anton V. Ushakov; Igor Vasilyev (Comput. Oper. Res., 2012)

Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable. - Pasquale Avella; Maurizio Boccia; Igor Vasilyev (INFORMS J. Comput., 2012)

A Branch-and-Cut Algorithm for the Multilevel Generalized Assignment Problem. - Pasquale Avella; Maurizio Boccia; Igor Vasilyev (IEEE Access, 2013)

Lifted and Local Reachability Cuts for the Vehicle Routing Problem with Time Windows. - Pasquale Avella; Maurizio Boccia; Igor Vasilyev (Comput. Oper. Res., 2013)

The dispatching problem on multitrack territories: Heuristic approaches based on mixed integer linear programming. - Maurizio Boccia; Carlo Mannino; Igor Vasilyev (Networks, 2013)

Polyhedral study of simple plant location problem with order. - Igor Vasilyev; Xenia Klimentova; Maurizio Boccia (Oper. Res. Lett., 2013)

Threshold robustness in discrete facility location problems: a bi-objective approach. - Emilio Carrizosa; Anton V. Ushakov; Igor Vasilyev (Optim. Lett., 2015)

The p-median Problem with Order for Two-Source Clustering. - Xenia Klimentova; Anton V. Ushakov; Igor Vasilyev (DOOR (Supplement), 2016)

Valid Inequalities for Time-Indexed Formulations of the Runway Scheduling Problem. - Igor Vasilyev; Pasquale Avella; Maurizio Boccia; Carlo Mannino (DOOR (Supplement), 2016)

A branch and cut heuristic for a runway scheduling problem. - Igor L. Vasilyev; Pasquale Avella; Maurizio Boccia (Autom. Remote. Control., 2016)

An implementation of exact knapsack separation. - Igor Vasilyev; Maurizio Boccia; Saïd Hanafi (J. Glob. Optim., 2016)

Time-Indexed Formulations for the Runway Scheduling Problem. - Pasquale Avella; Maurizio Boccia; Carlo Mannino; Igor Vasilyev (Transp. Sci., 2017)

Bi-level and Bi-objective p-Median Type Problems for Integrative Clustering: Application to Analysis of Cancer Gene-Expression and Drug-Response Data. - Anton V. Ushakov; Xenia Klimentova; Igor Vasilyev (IEEE ACM Trans. Comput. Biol. Bioinform., 2018)

A parallel heuristic for a k-medoids clustering problem with unfixed number of clusters. - Anton V. Ushakov; Igor Vasilyev (MIPRO, 2019)

A Local Branching MIP Heuristic for a Real-World Curriculum-Based Course Timetabling Problem. - Pasquale Avella; Maurizio Boccia; Sandro Viglione; Igor Vasilyev (MOTOR (2), 2019)

A Computational Comparison of Parallel and Distributed K-median Clustering Algorithms on Large-Scale Image Data. - Anton V. Ushakov; Igor Vasilyev (MOTOR (2), 2019)

A three-stage p-median based exact method for the optimal diversity management problem. - Adriano Masone; Claudio Sterle; Igor Vasilyev; Anton V. Ushakov (Networks, 2019)

An effective heuristic for large-scale fault-tolerant k-median problem. - Igor Vasilyev; Anton V. Ushakov; Nadezhda Maltugueva; Antonio Sforza (Soft Comput., 2019)

Locating Facilities Under Deliberate Disruptive Attacks. - Anton V. Ushakov; Igor Vasilyev (MOTOR, 2020)

Integer Programming Approach to the Data Traffic Paths Recovering Problem. - Igor Vasilyev; Dong Zhang; Jie Ren (MOTOR, 2020)

Near-optimal large-scale k-medoids clustering. - Anton V. Ushakov; Igor Vasilyev (Inf. Sci., 2021)

Generalized multiple strip packing problem: Formulations, applications, and solution algorithms. - Igor Vasilyev; Anton V. Ushakov; Dong Zhang; Jie Ren (Comput. Ind. Eng., 2023)