Igor Vasilyev

Publication Activity (10 Years)

Years Active: 2010-2023
Publications (10 Years): 15

Top Topics

Scheduling Problem

Integer Program

Facility Location

Parallel Data Mining

Top Venues

DOOR (Supplement)

Publications

Igor Vasilyev, Anton V. Ushakov, Dong Zhang, Jie Ren
Generalized multiple strip packing problem: Formulations, applications, and solution algorithms. Comput. Ind. Eng. 178 (2023)
Anton V. Ushakov, Igor Vasilyev
Near-optimal large-scale k-medoids clustering. Inf. Sci. 545 (2021)
Anton V. Ushakov, Igor Vasilyev
Locating Facilities Under Deliberate Disruptive Attacks. MOTOR (2020)
Igor Vasilyev, Dong Zhang, Jie Ren
Integer Programming Approach to the Data Traffic Paths Recovering Problem. MOTOR (2020)
Igor Vasilyev, Anton V. Ushakov, Nadezhda Maltugueva, Antonio Sforza
An effective heuristic for large-scale fault-tolerant k-median problem. Soft Comput. 23 (9) (2019)
Anton V. Ushakov, Igor Vasilyev
A parallel heuristic for a k-medoids clustering problem with unfixed number of clusters. MIPRO (2019)
Pasquale Avella, Maurizio Boccia, Sandro Viglione, Igor Vasilyev
A Local Branching MIP Heuristic for a Real-World Curriculum-Based Course Timetabling Problem. MOTOR (2) (2019)
Anton V. Ushakov, Igor Vasilyev
A Computational Comparison of Parallel and Distributed K-median Clustering Algorithms on Large-Scale Image Data. MOTOR (2) (2019)
Adriano Masone, Claudio Sterle, Igor Vasilyev, Anton V. Ushakov
A three-stage p-median based exact method for the optimal diversity management problem. Networks 74 (2) (2019)
Anton V. Ushakov, Xenia Klimentova, Igor Vasilyev
Bi-level and Bi-objective p-Median Type Problems for Integrative Clustering: Application to Analysis of Cancer Gene-Expression and Drug-Response Data. IEEE ACM Trans. Comput. Biol. Bioinform. 15 (1) (2018)
Pasquale Avella, Maurizio Boccia, Carlo Mannino, Igor Vasilyev
Time-Indexed Formulations for the Runway Scheduling Problem. Transp. Sci. 51 (4) (2017)
Igor Vasilyev, Maurizio Boccia, Saïd Hanafi
An implementation of exact knapsack separation. J. Glob. Optim. 66 (1) (2016)
Igor Vasilyev, Pasquale Avella, Maurizio Boccia, Carlo Mannino
Valid Inequalities for Time-Indexed Formulations of the Runway Scheduling Problem. DOOR (Supplement) (2016)
Xenia Klimentova, Anton V. Ushakov, Igor Vasilyev
-median Problem with Order for Two-Source Clustering. DOOR (Supplement) (2016)
Emilio Carrizosa, Anton V. Ushakov, Igor Vasilyev
Threshold robustness in discrete facility location problems: a bi-objective approach. Optim. Lett. 9 (7) (2015)
Igor Vasilyev, Xenia Klimentova, Maurizio Boccia
Polyhedral study of simple plant location problem with order. Oper. Res. Lett. 41 (2) (2013)
Pasquale Avella, Maurizio Boccia, Igor Vasilyev
Lifted and Local Reachability Cuts for the Vehicle Routing Problem with Time Windows. Comput. Oper. Res. 40 (8) (2013)
Pasquale Avella, Maurizio Boccia, Igor Vasilyev
A Branch-and-Cut Algorithm for the Multilevel Generalized Assignment Problem. IEEE Access 1 (2013)
Maurizio Boccia, Carlo Mannino, Igor Vasilyev
The dispatching problem on multitrack territories: Heuristic approaches based on mixed integer linear programming. Networks 62 (4) (2013)
Emilio Carrizosa, Anton V. Ushakov, Igor Vasilyev
A computational study of a nonlinear minsum facility location problem. Comput. Oper. Res. 39 (11) (2012)
Pasquale Avella, Maurizio Boccia, Igor Vasilyev
Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable. INFORMS J. Comput. 24 (1) (2012)
Pasquale Avella, Maurizio Boccia, Saverio Salerno, Igor Vasilyev
An aggregation heuristic for large scale p-median problem. Comput. Oper. Res. 39 (7) (2012)
Ider Tseveendorj, Igor Vasilyev
Preface: Baikal Conference on Optimization Methods and Their Applications. Stud. Inform. Univ. 9 (3) (2011)
Saïd Hanafi, Claudio Sterle, Anton V. Ushakov, Igor Vasilyev
A parallel subgradient algorithm for Lagrangean dual function of the p-median problem. Stud. Inform. Univ. 9 (3) (2011)
Pasquale Avella, Maurizio Boccia, Igor Vasilyev
A computational study of exact knapsack separation for the generalized assignment problem. Comput. Optim. Appl. 45 (3) (2010)