Vladimir G. Deineko

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 10

Top Topics

Quadratic Assignment Problem

Projection Matrices

Top Venues

Oper. Res. Lett.

Discret. Appl. Math.

Eur. J. Oper. Res.

Publications

Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
Travelling salesman paths on Demidenko matrices. Discret. Appl. Math. 354 (2024)
Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
The bipartite travelling salesman problem: A pyramidally solvable case. Oper. Res. Lett. 55 (2024)
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
Recognising permuted Demidenko matrices. CoRR (2023)
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
Recognising permuted Demidenko matrices. Oper. Res. Lett. 51 (5) (2023)
Merve Keskin, Jürgen Branke, Vladimir G. Deineko, Arne K. Strauss
Dynamic multi-period vehicle routing with touting. Eur. J. Oper. Res. 310 (1) (2023)
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
Travelling salesman paths on Demidenko matrices. CoRR (2020)
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
New special cases of the Quadratic Assignment Problem with diagonally structured coefficient matrices. Eur. J. Oper. Res. 267 (3) (2018)
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
The multi-stripe travelling salesman problem. Ann. Oper. Res. 259 (1-2) (2017)
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
Linearizable special cases of the QAP. J. Comb. Optim. 31 (3) (2016)
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
The multi-stripe travelling salesman problem. CoRR (2016)
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
A New Tractable Case of the QAP with a Robinson Matrix. COCOA (2015)
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
Well-solvable cases of the QAP with block-structured matrices. Discret. Appl. Math. 186 (2015)
Vladimir G. Deineko, Gerhard J. Woeginger
Another Look at the Shoelace TSP: The Case of Very Old Shoes. FUN (2014)
Vladimir G. Deineko, Bettina Klinz, Alexander Tiskin, Gerhard J. Woeginger
Four-point conditions for the TSP: The complete complexity classification. Discret. Optim. 14 (2014)
Vladimir G. Deineko, Gerhard J. Woeginger
Two hardness results for Gamson's game. Soc. Choice Welf. 43 (4) (2014)
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
Linearizable special cases of the QAP. CoRR (2014)
Vladimir G. Deineko, Gerhard J. Woeginger
Complexity and in-approximability of a selection problem in robust optimization. 4OR 11 (3) (2013)
Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
Uniqueness in quadratic and hyperbolic 0-1 programming problems. CoRR (2013)
Vladimir G. Deineko, Gerhard J. Woeginger
Two hardness results for core stability in hedonic coalition formation games. Discret. Appl. Math. 161 (13-14) (2013)
Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
Uniqueness in quadratic and hyperbolic 0-1 programming problems. Oper. Res. Lett. 41 (6) (2013)
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
Another well-solvable case of the QAP: Maximizing the job completion time variance. Oper. Res. Lett. 40 (5) (2012)
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
The x-and-y-axes travelling salesman problem. Eur. J. Oper. Res. 223 (2) (2012)
Vladimir G. Deineko, Gerhard J. Woeginger
A well-solvable special case of the bounded knapsack problem. Oper. Res. Lett. 39 (2) (2011)
Vladimir G. Deineko, Dvir Shabtay, George Steiner
On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices. J. Heuristics 17 (1) (2011)
Vladimir G. Deineko, Gerhard J. Woeginger
Unbounded knapsack problems with arithmetic weight sequences. Eur. J. Oper. Res. 213 (2) (2011)
Vladimir G. Deineko, Gerhard J. Woeginger
Pinpointing the complexity of the interval min-max regret knapsack problem. Discret. Optim. 7 (4) (2010)
Vladimir G. Deineko, Gerhard J. Woeginger
A new family of scientific impact measures: The generalized Kosmulski-indices. Scientometrics 80 (3) (2009)
Vladimir G. Deineko, Alexander Tiskin
Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough? ACM J. Exp. Algorithmics 14 (2009)
Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
The complexity of computing the Muirhead-Dalton distance. Math. Soc. Sci. 57 (2) (2009)
Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
Polygons with inscribed circles and prescribed side lengths. Appl. Math. Lett. 22 (5) (2009)
Vladimir G. Deineko, Alexander Tiskin
Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio. Electron. Notes Discret. Math. 32 (2009)
Vladimir G. Deineko, Peter Jonsson, Mikael Klasson, Andrei A. Krokhin
The approximability of MAX CSP with fixed-value constraints. J. ACM 55 (4) (2008)
Vladimir G. Deineko, Alexandre Tiskin
Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio CoRR (2007)
Vladimir G. Deineko, Alexandre Tiskin
Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP. WEA (2007)
Vladimir G. Deineko, Alexandre Tiskin
Fast minimum-weight double-tree shortcutting for Metric TSP: Is the best one good enough? CoRR (2007)
Vladimir G. Deineko, Peter Jonsson, Mikael Klasson, Andrei A. Krokhin
The approximability of MAX CSP with fixed-value constraints CoRR (2006)
Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
Exact algorithms for the Hamiltonian cycle problem in planar graphs. Oper. Res. Lett. 34 (3) (2006)
Vladimir G. Deineko, Gerhard J. Woeginger
Well-solvable instances for the partition problem. Appl. Math. Lett. 19 (10) (2006)
Vladimir G. Deineko, Gerhard J. Woeginger
On the robust assignment problem under a fixed number of cost scenarios. Oper. Res. Lett. 34 (2) (2006)
Vladimir G. Deineko, Alexandre Tiskin
One-Sided Monge TSP Is NP-Hard. ICCSA (3) (2006)
Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
Four point conditions and exponential neighborhoods for symmetric TSP. SODA (2006)
Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger
The traveling salesman problem with few inner points. Oper. Res. Lett. 34 (1) (2006)
Vladimir G. Deineko, Gerhard J. Woeginger
On the dimension of simple monotonic games. Eur. J. Oper. Res. 170 (1) (2006)
Vladimir G. Deineko, Gerhard J. Woeginger
Some Problems around Traveling Salesmen, Dart Boards, and Euro-coins. Bull. EATCS 90 (2006)
Vladimir G. Deineko, George Steiner, Zhihui Xue
Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices. J. Comb. Optim. 9 (4) (2005)
Vladimir G. Deineko
New exponential neighbourhood for polynomially solvable TSPs. Electron. Notes Discret. Math. 17 (2004)
Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger
The Traveling Salesman Problem with Few Inner Points. COCOON (2004)
Rainer E. Burkard, Vladimir G. Deineko
On the Euclidean TSP with a permuted Van der Veen matrix. Inf. Process. Lett. 91 (6) (2004)
Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
Which matrices are immune against the transportation paradox? Discret. Appl. Math. 130 (3) (2003)
Vladimir G. Deineko, Gerhard J. Woeginger
Complexity and approximability results for slicing floorplan designs. Eur. J. Oper. Res. 149 (3) (2003)
Vladimir G. Deineko, Gerhard J. Woeginger
Hardness of approximation of the discrete time-cost tradeoff problem. Oper. Res. Lett. 29 (5) (2001)
Vladimir G. Deineko, Gerhard J. Woeginger
systems. Oper. Res. Lett. 28 (4) (2001)
Vladimir G. Deineko, Gerhard J. Woeginger
A study of exponential neighborhoods for the Travelling Salesman Problem and for the Quadratic Assignment Problem. Math. Program. 87 (3) (2000)
Vladimir G. Deineko, Gerhard J. Woeginger
The Maximum Travelling Salesman Problem on Symmetric Demidenko Matrices. Discret. Appl. Math. 99 (1-3) (2000)
Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger
Erratum: The Travelling Salesman and the PQ-Tree. Math. Oper. Res. 24 (1) (1999)
Rainer E. Burkard, Vladimir G. Deineko, René van Dal, Jack A. A. van der Veen, Gerhard J. Woeginger
Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey. SIAM Rev. 40 (3) (1998)
Rainer E. Burkard, Vladimir G. Deineko
On the Traveling Salesman Problem with a Relaxed Monge Matrix. Inf. Process. Lett. 67 (5) (1998)
Vladimir G. Deineko, Gerhard J. Woeginger
A solvable case of the quadratic assignment problem. Oper. Res. Lett. 22 (1) (1998)
Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger
The Travelling Salesman Problem on Permuted Monge Matrices. J. Comb. Optim. 2 (4) (1998)
Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger
Sometimes Travelling is Easy: The Master Tour Problem. SIAM J. Discret. Math. 11 (1) (1998)
Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger
The Travelling Salesman and the PQ-Tree. Math. Oper. Res. 23 (3) (1998)
Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger
The Travelling Salesman and the PQ-Tree. IPCO (1996)
Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger
On the Recognition of Permuted Supnick and Incomplete Monge Matrices. Acta Informatica 33 (6) (1996)
Vladimir G. Deineko, Gerhard J. Woeginger
The Convex-Hull-and-k-Line Travelling Salesman Problem. Inf. Process. Lett. 59 (6) (1996)
Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger
Sometimes Travelling is Easy: The Master Tour Problem. ESA (1995)
Rainer E. Burkard, Vladimir G. Deineko
Polynomially Solvable Cases of the Traveling Salesman Problem and a New Exponential Neighborhood. Computing 54 (3) (1995)
Vladimir G. Deineko, René van Dal, Günter Rote
The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case. Inf. Process. Lett. 51 (3) (1994)
Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger
A general approach to avoiding two by two submatrices. Computing 52 (4) (1994)