Follow
Igor Vasilyev
Igor Vasilyev
Institute for System Dynamics and Control Theory of Siberian Branch of Russian Academy of Sciences
Verified email at icc.ru - Homepage
Title
Cited by
Cited by
Year
Computational study of large-scale p-Median problems
P Avella, A Sassano, I Vasil'Ev
Mathematical Programming 109, 89-114, 2007
2882007
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
1102012
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
882005
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
762010
An effective heuristic for large-scale capacitated facility location problems
P Avella, M Boccia, A Sforza, I Vasilev
Journal of Heuristics 15, 597-615, 2009
682009
A computational study of local search algorithms for Italian high-school timetabling
P Avella, B DAuria, S Salerno, I Vasilev
Journal of Heuristics 13, 543-556, 2007
622007
Near-optimal large-scale k-medoids clustering
AV Ushakov, I Vasilyev
Information Sciences 545, 344-362, 2021
612021
A Cut and Branch Approach for the Capacitated p-Median Problem Based on Fenchel Cutting Planes
M Boccia, A Sforza, C Sterle, I Vasilyev
Journal of mathematical modelling and algorithms 7, 43-58, 2008
542008
The branch and cut method for the facility location problem with clients preferences
IL Vasilyev, KB Klimentova
Journal of Applied and Industrial Mathematics 4, 441-454, 2010
522010
New lower bounds for the facility location problem with clients preferences
IL Vasilev, KB Klimentova, YA Kochetov
Computational Mathematics and Mathematical Physics 49, 1010-1020, 2009
472009
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
442013
Time-indexed formulations for the runway scheduling problem
P Avella, M Boccia, C Mannino, I Vasilyev
Transportation Science 51 (4), 1196-1209, 2017
422017
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
312009
Polyhedral study of simple plant location problem with order
I Vasilyev, X Klimentova, M Boccia
Operations Research Letters 41 (2), 153-158, 2013
262013
A computational study of a nonlinear minsum facility location problem
E Carrizosa, A Ushakov, I Vasilyev
Computers & Operations Research 39 (11), 2625-2633, 2012
262012
Threshold robustness in discrete facility location problems: a bi-objective approach
E Carrizosa, A Ushakov, I Vasilyev
Optimization Letters 9 (7), 1297-1314, 2015
242015
A decomposition approach for a very large scale optimal diversity management problem
P Avella, M Boccia, C Di Martino, G Oliviero, A Sforza, I Vasilev
4OR 3, 23-37, 2005
232005
A branch-and-cut algorithm for the multilevel generalized assignment problem
P Avella, M Boccia, I Vasilyev
IEEE Access 1, 475-479, 2013
222013
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
222005
, ,
49 (6), 1055-1066, 2009
212009
The system can't perform the operation now. Try again later.
Articles 1–20