Vladimir Deineko
- Associate Professor of Operational Research
Habilitation (Graz (Austria)-Kiev(Ukraine), PhD (Minsk, Moscow, Academy of Science)
Room E1.17 (Social Studies Building)
Warwick Business School
The University of Warwick
Coventry
CV4 7AL
United Kingdom
e
Biography
Thirty years of teaching experience in a variety of cultural environments; formerly associate professor at Dnepropetrovsk State University, Ukraine, and invited researcher at University of Technology, Graz, Austria. Participation in consultancy projects related to problem solving in industry, commerce, and the public sector.
Research interests
Algorithmic aspects of the problem solving process with the main focus on the analysis of efficiently solvable cases of hard optimisation problems such as travelling salesman problem and quadratic assignment problem; design and implementation of exact and approximate algorithms for combinatorial optimisation problems: vehicle routing problem, bin packing problem, network optimisation problems etc.
Selected research projects
- Special Structures in Vehicle Routing Problems: EPSRC, March 2008 - March 2010.
- Conference Grant - 5th workshop on experimental algorithms / V Deineko: Royal Society, June 2007 - June 2007.
- ACM-SIM Symposium on Discrete Algorithms, 8th Workshop on Algorithm Engineering and Experiments - 8th Workshop: Royal Society, January 2006 - January 2006.
Only selected externally-funded projects are listed here.
Teaching activity this year
Masters Portfolio
- IB93Y0 Dissertation
- IB94Z0 Management Science & Operational Research Techniques
Undergraduate
- IB1040 Mathematical Programming I
Publications
Journal articles
- Pinpointing the complexity of the interval min-max regret knapsack problem. Discrete Optimization (2010): 191-196.
- Fast minimum-weight double-tree shortcutting for metric TSP: is the best one good enough? ACM Journal on Experimental Algorithmics 14, article 4.6 (2009) (Published): 4.6:1-4.6:16.
- A new family of scientific impact measures : the generalized Kosmulski-indices. Scientometrics 80 (2009): 819-826.
- Polygons with inscribed circles and prescribed side lengths. Applied Mathematics Letters 22 (2009) (Published): 704-706.
- Min-weight double-tree shortcutting for Metric TSP: bounding the approximation ratio. Electronic Notes in Discrete Mathematics 32 (2009) (Published): 19-26.