Igor Vasil'ev

According to our database1, Igor Vasil'ev
  • authored at least 26 papers between 2003 and 2016.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
An implementation of exact knapsack separation.
J. Global Optimization, 2016

Valid Inequalities for Time-Indexed Formulations of the Runway Scheduling Problem.
Proceedings of the Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), Vladivostok, Russia, September 19, 2016

The p-median Problem with Order for Two-Source Clustering.
Proceedings of the Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), Vladivostok, Russia, September 19, 2016

2015
Threshold robustness in discrete facility location problems: a bi-objective approach.
Optimization Letters, 2015

2013
Polyhedral study of simple plant location problem with order.
Oper. Res. Lett., 2013

The dispatching problem on multitrack territories: Heuristic approaches based on mixed integer linear programming.
Networks, 2013

Lifted and Local Reachability Cuts for the Vehicle Routing Problem with Time Windows.
Computers & OR, 2013

A Branch-and-Cut Algorithm for the Multilevel Generalized Assignment Problem.
IEEE Access, 2013

2012
Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable.
INFORMS Journal on Computing, 2012

A computational study of a nonlinear minsum facility location problem.
Computers & OR, 2012

An aggregation heuristic for large scale p-median problem.
Computers & OR, 2012

2011
Preface: Baikal Conference on Optimization Methods and Their Applications.
Stud. Inform. Univ., 2011

A parallel subgradient algorithm for Lagrangean dual function of the p-median problem.
Stud. Inform. Univ., 2011

2010
A computational study of exact knapsack separation for the generalized assignment problem.
Comp. Opt. and Appl., 2010

2009
Computational experience with general cutting planes for the Set Covering problem.
Oper. Res. Lett., 2009

An effective heuristic for large-scale capacitated facility location problems.
J. Heuristics, 2009

2008
A Cut and Branch Approach for the Capacitated p-Median Problem Based on Fenchel Cutting Planes.
J. Math. Model. Algorithms, 2008

A grid-aware MIP solver: Implementation and case studies.
Future Generation Comp. Syst., 2008

Automatic defects classification with p-median clustering technique.
Proceedings of the 10th International Conference on Control, 2008

2007
Computational study of large-scale p -Median problems.
Math. Program., 2007

A computational study of local search algorithms for Italian high-school timetabling.
J. Heuristics, 2007

2005
A Computational Study of a Cutting Plane Algorithm for University Course Timetabling.
J. Scheduling, 2005

A Branch-and-Cut Algorithm for the Median-Path Problem.
Comp. Opt. and Appl., 2005

A decomposition approach for a very large scale optimal diversity management problem.
4OR, 2005

A Grid-Aware Branch, Cut and Price Implementation.
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 2005

2003
A heuristic for large-scale p-median instances.
Electronic Notes in Discrete Mathematics, 2003


  Loading...