Igor Vasil'ev

12 papers C 1Journal 10Unranked 1
YearRankTypeTitle / Venue / Authors
2009 J jnl
An effective heuristic for large-scale capacitated facility location problems.
J. Heuristics
Pasquale Avella, Maurizio Boccia, Antonio Sforza, Igor Vasil'ev
2009 J jnl
Computational experience with general cutting planes for the Set Covering problem.
Oper. Res. Lett.
Pasquale Avella, Maurizio Boccia, Igor Vasil'ev
2008 J jnl
A Cut and Branch Approach for the Capacitated
J. Math. Model. Algorithms
Maurizio Boccia, Antonio Sforza, Claudio Sterle, Igor Vasil'ev
2008 J jnl
A grid-aware MIP solver: Implementation and case studies.
Future Gener. Comput. Syst.
Emilio Pasquale Mancini, Sonya Marcarelli, Igor Vasil'ev, Umberto Villano
2008 C conf
Automatic defects classification with p-median clustering technique.
ICARCV
Denis N. Sidorov, Wong Soon Wei, Igor Vasil'ev, Saverio Salerno
2007 J jnl
A computational study of local search algorithms for Italian high-school timetabling.
J. Heuristics
Pasquale Avella, Bernardo D'Auria, Saverio Salerno, Igor Vasil'ev
2007 J jnl
Computational study of large-scale
Math. Program.
Pasquale Avella, Antonio Sassano, Igor Vasil'ev
2005 J jnl
A Branch-and-Cut Algorithm for the Median-Path Problem.
Comput. Optim. Appl.
Pasquale Avella, Maurizio Boccia, Antonio Sforza, Igor Vasil'ev
2005 J jnl
A Computational Study of a Cutting Plane Algorithm for University Course Timetabling.
J. Sched.
Pasquale Avella, Igor Vasil'ev
2005 — conf
A Grid-Aware Branch, Cut and Price Implementation.
PVM/MPI
Emilio Mancini, Sonya Marcarelli, Pierluigi Ritrovato, Igor Vasil'ev, Umberto Villano
2005 J jnl
A decomposition approach for a very large scale optimal diversity management problem.
4OR
Pasquale Avella, Maurizio Boccia, Carmine Di Martino, Giuseppe Oliviero, Antonio Sforza, Igor Vasil'ev
2003 J jnl
A heuristic for large-scale p-median instances.
Electron. Notes Discret. Math.
Pasquale Avella, Antonio Sassano, Igor Vasil'ev