SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Igor Vasilyev · Study

Home/Author

Igor Vasilyev

13 works· latest 2018· 5 institutionscluster: provisionalORCID 0000-0003-1862-4586

h-index13

i1013

Citations630

Works here13

05

06

07

08

09

10

11

12

15

18

Most cited in this library

Computational study of large-scale p-Median problems2006 · 188 citations
An aggregation heuristic for large scale p-median problem2011 · 81 citations
A Computational Study of a Cutting Plane Algorithm for University Course Timetabling2005 · 54 citations
An effective heuristic for large-scale capacitated facility location problems2008 · 51 citations
A Cut and Branch Approach for the Capacitated p-Median Problem Based on Fenchel Cutting Planes2007 · 50 citations

Works

13 shown

A three‐stage p‐median based exact method for the optimal diversity management problem

Networks·2018·4 authors

16citations

Threshold robustness in discrete facility location problems: a bi-objective approach

Optimization Letters·2015·3 authors·Open access

20citations

Polyhedral study of simple plant location problem with order

Operations Research Letters·2012·3 authors

22citations

A computational study of a nonlinear minsum facility location problem

Computers & Operations Research·2012·3 authors·Open access

15citations

An aggregation heuristic for large scale p-median problem

Computers & Operations Research·2011·4 authors

81citations

The branch and cut method for the facility location problem with client’s preferences

Journal of Applied and Industrial Mathematics·2010·2 authors

41citations

New lower bounds for the facility location problem with clients’ preferences

Computational Mathematics and Mathematical Physics·2009·3 authors

40citations

An effective heuristic for large-scale capacitated facility location problems

Journal of Heuristics·2008·4 authors

51citations

A Cut and Branch Approach for the Capacitated p-Median Problem Based on Fenchel Cutting Planes

Journal of Mathematical Modelling and Algorithms·2007·4 authors

50citations

A computational study of local search algorithms for Italian high-school timetabling

Journal of Heuristics·2007·4 authors

38citations

Computational study of large-scale p-Median problems

Mathematical Programming·2006·3 authors

188citations

A Computational Study of a Cutting Plane Algorithm for University Course Timetabling

Journal of Scheduling·2005·2 authors

54citations

A decomposition approach for a very large scale optimal diversity management problem

4OR·2005·5 authors

14citations