Follow
Vladimir Deineko, PhD, DSc
Vladimir Deineko, PhD, DSc
Former Associate Professor (Reader) Warwick Business School
No verified email
Title
Cited by
Cited by
Year
Well-solvable special cases of the traveling salesman problem: a survey
RE Burkard, VG Deineko, R Van Dal, JAA van der Veen, GJ Woeginger
SIAM review 40 (3), 496-546, 1998
2181998
A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem
VG Deineko, GJ Woeginger
Mathematical Programming 87 (3), 519-542, 2000
1332000
The travelling salesman and the PQ-tree
RE Burkard, VG Deĭneko, GJ Woeginger
Mathematics of Operations Research 23 (3), 613-623, 1998
681998
Hardness of approximation of the discrete time-cost tradeoff problem
VG Deı̌neko, GJ Woeginger
Operations Research Letters 29 (5), 207-210, 2001
612001
Sometimes travelling is easy: the master tour problem
VG Deineko, R Rudolf, GJ Woeginger
SIAM Journal on Discrete Mathematics 11 (1), 81-93, 1998
561998
The convex-hull-and-line traveling salesman problem: a solvable case
VG Deineko, R van Dal, G Rote
Information Processing Letters 51 (3), 141-148, 1994
551994
The approximability of Max CSP with fixed-value constraints
V Deineko, P Jonsson, M Klasson, A Krokhin
Journal of the ACM (JACM) 55 (4), 1-37, 2008
542008
The traveling salesman problem with few inner points
V Deineko, M Hoffmann, Y Okamoto, GJ Woeginger
Operations Research Letters 34 (1), 106-110, 2006
54*2006
On the reconstruction of specially structured matrices
VG Deineko, VL Filonenko
Aktualnyje Problemy EVM, programmirovanije, Dnepropetrovsk, DGU, 1979
541979
Exact algorithms for the Hamiltonian cycle problem in planar graphs
V Deineko, B Klinz, GJ Woeginger
Operations Research Letters 34 (3), 269-274, 2006
482006
On the robust assignment problem under a fixed number of cost scenarios
V Deineko, GJ Woeginger
Operations Research Letters 34 (2), 175-179, 2006
482006
Four-point conditions for the TSP: The complete complexity classification
VG Deineko, B Klinz, A Tiskin, GJ Woeginger
Discrete optimization 14, 147-159, 2014
44*2014
On the dimension of simple monotonic games
VG Deı̆neko, GJ Woeginger
European Journal of Operational Research 170 (1), 315-318, 2006
402006
A solvable case of the quadratic assignment problem
VG Deineko, GJ Woeginger
Operations Research Letters 22 (1), 13-17, 1998
401998
A new family of scientific impact measures: The generalized Kosmulski-indices
V Deineko, G Woeginger
Scientometrics 80 (3), 819-826, 2009
312009
Pinpointing the complexity of the interval min–max regret knapsack problem
VG Deineko, GJ Woeginger
Discrete Optimization 7 (4), 191-196, 2010
302010
Well-solvable special cases of the tsp: A survey
RE Burkard, VG Deineko, R Van Dal
Universität Graz/Technische Universität Graz. SFB F003-Optimierung und Kontrolle, 1995
271995
The convex-hull-and-k-line travelling salesman problem
VG Deĭneko, GJ Woeginger
Information Processing Letters 59 (6), 295-301, 1996
251996
Polynomially solvable cases of the traveling salesman problem and a new exponential neighbourhood
RE Burkard, V Deineko
Computing 54, 191-211, 1995
251995
Linearizable special cases of the QAP
E Cela, VG Deineko, GJ Woeginger
Journal of Combinatorial optimization 31, 1269-1279, 2016
232016
The system can't perform the operation now. Try again later.
Articles 1–20