default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIgor Vasil'ev
Person information
- affiliation: Russian Academy of Sciences, Siberian Branch, Matrosov Institute for System Dynamics and Control Theory, Irkutsk, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j29]Igor Vasilyev, Anton V. Ushakov
, Dong Zhang, Jie Ren:
Generalized multiple strip packing problem: Formulations, applications, and solution algorithms. Comput. Ind. Eng. 178: 109096 (2023)- 2021
- [j28]Anton V. Ushakov, Igor Vasilyev:
Near-optimal large-scale k-medoids clustering. Inf. Sci. 545: 344-362 (2021) - 2020
- [c9]Anton V. Ushakov, Igor Vasilyev:
Locating Facilities Under Deliberate Disruptive Attacks. MOTOR 2020: 359-372 - [c8]Igor Vasilyev, Dong Zhang, Jie Ren:
Integer Programming Approach to the Data Traffic Paths Recovering Problem. MOTOR 2020: 455-469
2010 – 2019
- 2019
- [j27]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): 174-189 (2019) - [j26]Igor Vasilyev, Anton V. Ushakov, Nadezhda Maltugueva, Antonio Sforza:
An effective heuristic for large-scale fault-tolerant k-median problem. Soft Comput. 23(9): 2959-2967 (2019) - [c7]Anton V. Ushakov, Igor Vasilyev:
A parallel heuristic for a k-medoids clustering problem with unfixed number of clusters. MIPRO 2019: 1116-1120 - [c6]Anton V. Ushakov, Igor Vasilyev:
A Computational Comparison of Parallel and Distributed K-median Clustering Algorithms on Large-Scale Image Data. MOTOR (2) 2019: 119-130 - [c5]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: 438-451 - 2018
- [j25]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): 46-59 (2018) - 2017
- [j24]Pasquale Avella, Maurizio Boccia, Carlo Mannino, Igor Vasilyev:
Time-Indexed Formulations for the Runway Scheduling Problem. Transp. Sci. 51(4): 1196-1209 (2017) - 2016
- [j23]Igor L. Vasilyev, Pasquale Avella, Maurizio Boccia:
A branch and cut heuristic for a runway scheduling problem. Autom. Remote. Control. 77(11): 1985-1993 (2016) - [j22]Igor Vasilyev, Maurizio Boccia, Saïd Hanafi:
An implementation of exact knapsack separation. J. Glob. Optim. 66(1): 127-150 (2016) - [c4]Xenia Klimentova, Anton V. Ushakov, Igor Vasilyev:
The p-median Problem with Order for Two-Source Clustering. DOOR (Supplement) 2016: 536-544 - [c3]Igor Vasilyev, Pasquale Avella, Maurizio Boccia, Carlo Mannino:
Valid Inequalities for Time-Indexed Formulations of the Runway Scheduling Problem. DOOR (Supplement) 2016: 787-790 - 2015
- [j21]Emilio Carrizosa, Anton V. Ushakov, Igor Vasilyev:
Threshold robustness in discrete facility location problems: a bi-objective approach. Optim. Lett. 9(7): 1297-1314 (2015) - 2013
- [j20]Pasquale Avella, Maurizio Boccia, Igor Vasilyev:
A Branch-and-Cut Algorithm for the Multilevel Generalized Assignment Problem. IEEE Access 1: 475-479 (2013) - [j19]Pasquale Avella, Maurizio Boccia, Igor Vasilyev:
Lifted and Local Reachability Cuts for the Vehicle Routing Problem with Time Windows. Comput. Oper. Res. 40(8): 2004-2010 (2013) - [j18]Maurizio Boccia, Carlo Mannino, Igor Vasilyev:
The dispatching problem on multitrack territories: Heuristic approaches based on mixed integer linear programming. Networks 62(4): 315-326 (2013) - [j17]Igor Vasilyev, Xenia Klimentova, Maurizio Boccia:
Polyhedral study of simple plant location problem with order. Oper. Res. Lett. 41(2): 153-158 (2013) - 2012
- [j16]Pasquale Avella, Maurizio Boccia, Saverio Salerno, Igor Vasilyev:
An aggregation heuristic for large scale p-median problem. Comput. Oper. Res. 39(7): 1625-1632 (2012) - [j15]Emilio Carrizosa, Anton V. Ushakov, Igor Vasilyev:
A computational study of a nonlinear minsum facility location problem. Comput. Oper. Res. 39(11): 2625-2633 (2012) - [j14]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): 165-171 (2012) - 2011
- [j13]Ider Tseveendorj, Igor Vasilyev:
Preface: Baikal Conference on Optimization Methods and Their Applications. Stud. Inform. Univ. 9(3): 3-6 (2011) - [j12]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): 105-124 (2011) - 2010
- [j11]Pasquale Avella, Maurizio Boccia, Igor Vasilyev:
A computational study of exact knapsack separation for the generalized assignment problem. Comput. Optim. Appl. 45(3): 543-555 (2010)
2000 – 2009
- 2009
- [j10]Pasquale Avella, Maurizio Boccia, Antonio Sforza, Igor Vasil'ev:
An effective heuristic for large-scale capacitated facility location problems. J. Heuristics 15(6): 597-615 (2009) - [j9]Pasquale Avella, Maurizio Boccia, Igor Vasil'ev:
Computational experience with general cutting planes for the Set Covering problem. Oper. Res. Lett. 37(1): 16-20 (2009) - 2008
- [j8]Emilio Pasquale Mancini, Sonya Marcarelli, Igor Vasil'ev, Umberto Villano:
A grid-aware MIP solver: Implementation and case studies. Future Gener. Comput. Syst. 24(2): 133-141 (2008) - [j7]Maurizio Boccia, Antonio Sforza, Claudio Sterle, Igor Vasil'ev:
A Cut and Branch Approach for the Capacitated p-Median Problem Based on Fenchel Cutting Planes. J. Math. Model. Algorithms 7(1): 43-58 (2008) - [c2]Denis N. Sidorov, Wong Soon Wei, Igor Vasil'ev, Saverio Salerno:
Automatic defects classification with p-median clustering technique. ICARCV 2008: 775-780 - 2007
- [j6]Pasquale Avella, Bernardo D'Auria, Saverio Salerno, Igor Vasil'ev:
A computational study of local search algorithms for Italian high-school timetabling. J. Heuristics 13(6): 543-556 (2007) - [j5]Pasquale Avella, Antonio Sassano, Igor Vasil'ev:
Computational study of large-scale p -Median problems. Math. Program. 109(1): 89-114 (2007) - 2005
- [j4]Pasquale Avella, Maurizio Boccia, Carmine Di Martino, Giuseppe Oliviero, Antonio Sforza, Igor Vasil'ev:
A decomposition approach for a very large scale optimal diversity management problem. 4OR 3(1): 23-37 (2005) - [j3]Pasquale Avella, Maurizio Boccia, Antonio Sforza, Igor Vasil'ev:
A Branch-and-Cut Algorithm for the Median-Path Problem. Comput. Optim. Appl. 32(3): 215-230 (2005) - [j2]Pasquale Avella, Igor Vasil'ev:
A Computational Study of a Cutting Plane Algorithm for University Course Timetabling. J. Sched. 8(6): 497-514 (2005) - [c1]Emilio Mancini, Sonya Marcarelli, Pierluigi Ritrovato, Igor Vasil'ev, Umberto Villano:
A Grid-Aware Branch, Cut and Price Implementation. PVM/MPI 2005: 38-47 - 2003
- [j1]Pasquale Avella, Antonio Sassano, Igor Vasil'ev:
A heuristic for large-scale p-median instances. Electron. Notes Discret. Math. 13: 14-17 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
