Vladimir Deineko
- Associate Professor of Operational Research
PhD (Minsk, Moscow, Academy of Science), Habilitation (higher Doctorate) (Graz (Austria)-Kiev(Ukraine)
Biography
Thirty years of teaching experience in a varitey 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 Deinko: 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
Doctoral
- WB7120 Quantitative Research Methods: FTRES
Masters Portfolio
- IB93Y0 Dissertation
- IB94Z0 Managmnt Science & Operational Research Techniques module leader
- IB9V50 Mathematical Programming and Heuristics
Undergraduate
- IB1040 Mathematical Programming I module leader
- IB2200 Quantitative Methods for Resource Management module leader
Publications
Journal articles
- The complexity of computing the Muirhead-Dalton distance. Mathematical Social Sciences 57 (2009) (Published): 282-284.
- 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 (2009) (Published): 19-26.
- A new family of scientific impact measures : the generalized Kosmulski-indices. Scientometrics 80 (2009): 819-826.
- The approximability of MAX CSP with fixed-value constraints. Journal Of The ACM 55 (2008) (Published): 16-16.
