Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Statistics
  • Help & Advice
University of Warwick

The Library

  • Login

Browse by Warwick Author

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Number of items: 19.

Çela, Eranda, Deineko, Vladimir G. and Woeginger, Gerhard J.. (2012) The x-and-y-axes travelling salesman problem. European Journal of Operational Research, 223 (2). pp. 333-345. ISSN 0377-2217

Çela, Eranda, Deineko, Vladimir G. and Woeginger, Gerhard J.. (2012) Another well-solvable case of the QAP : maximizing the job completion time variance. Operations Research Letters, Vol.40 (No.5). pp. 356-359. ISSN 0167-6377

Deineko, Vladimir G. and Woeginger, Gerhard. (2011) Unbounded knapsack problems with arithmetic weight sequences. European Journal of Operational Research, Vol.213 (No.2). pp. 384-387. ISSN 0377-2217

Deineko, Vladimir G. and Woeginger, Gerhard J.. (2011) A well-solvable special case of the bounded knapsack problem. Operations Research Letters, Vol.39 (No.2). pp. 118-120. ISSN 0167-6377

Deineko, Vladimir G., Shabtay, Dvir and Steiner, George. (2011) On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices. Journal of Heuristics, Vol.17 (No.1). pp. 61-96. ISSN 1381-1231

Deineko, Vladimir G. and Woeginger, Gerhard J.. (2010) Pinpointing the complexity of the interval min-max regret knapsack problem. Discrete Optimization, Vol.7 (No.4). pp. 191-196. ISSN 1572-5286

Deineko, Vladimir G. and Tiskin, Alexander. (2009) Fast minimum-weight double-tree shortcutting for metric TSP. Journal of Experimental Algorithmics, Vol.14 . 4.6. ISSN 1084-6654

Deineko, Vladimir G. and Tiskin, Alexander. (2009) Fast minimum-weight double-tree shortcutting for metric TSP. Journal of Experimental Algorithmics, Vol.14 . p. 6. ISSN 1084-6654

Deineko, Vladimir G. and Woeginger, Gerhard J.. (2009) A new family of scientific impact measures : the generalized Kosmulski-indices. Scientometrics, Vol.80 (No.3). pp. 819-826. ISSN 0138-9130

Deineko, Vladimir G., Klinz, Bettina and Woeginger, Gerhard J.. (2009) Polygons with inscribed circles and prescribed side lengths. Applied Mathematics Letters, Vol.22 (No.5). pp. 704-706. ISSN 0893-9659

Deineko, Vladimir G. and Tiskin, Alexander. (2009) Min-Weight Double-Tree Shortcutting for Metric TSP: Bounding the Approximation Ratio. Electronic Notes in Discrete Mathematics, 32 . pp. 19-26. ISSN 1571-0653

Deineko, Vladimir G. and Tiskin, Alexander. (2009) Min-weight double-tree shortcutting for Metric TSP : bounding the approximation ratio. Electronic Notes in Discrete Mathematics, Vol.32 . pp. 19-26. ISSN 1571-0653

Deineko, Vladimir G., Klinz, Bettina and Woeginger, Gerhard J.. (2009) The complexity of computing the Muirhead-Dalton distance. Mathematical Social Sciences, Vol.57 (No.2). pp. 282-284. ISSN 0165-4896

Deineko, Vladimir G., O'Brien, Frances A. and Ridd, T. (2009) Group up to learn together: a system for equitable allocation of students to groups. In: 1st International Conference on Computer Supported Education, Lisbon, Portugal, March 23-26, 2009. Published in: CSEDU 2009 - Proceedings of the First International Conference on Computer Supported Education, Vol.1 pp. 140-145.

Deineko, Vladimir G., Jonsson, P., Klasson, Mikael and Krokhin, Andrei. (2008) The approximability of MAX CSP with fixed-value constraints. Association for Computing Machinery Journal, Vol.55 (No.4). ISSN 0004-5411

Deineko, Vladimir G. and Woeginger, Gerhard J.. (2006) Well-solvable instances for the partition problem. APPLIED MATHEMATICS LETTERS, 19 (10). pp. 1053-1056. ISSN 0893-9659

Deineko, Vladimir G. and Woeginger, Gerhard J.. (2006) On the robust assignment problem under a fixed number of cost scenarios. Operations Research Letters, Vol.34 (No.2). pp. 175-179. ISSN 0167-6377

Deineko, Vladimir, Klinz, Bettina and Woeginger, Gerhard J. (2006) Four point conditions and exponential neighborhoods for symmetric TSP. In: 17th ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, JAN, 2006. Published in: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms pp. 544-553.

Deineko, Vladimir and Tiskin, Alexander (2006) One-sided monge TSP is NP-Hard. In: International Conference on Computational Science and Its Applications (ICCSA 2006), Glasgow, SCOTLAND, MAY 08-AUG 11, 2006. Published in: COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2006, PT 3, 3982 pp. 793-801.

This list was generated on Tue Jun 18 17:43:23 2013 BST.
twitter

Email us: publications@warwick.ac.uk
Contact Details
About Us