V. Deineko

发表

The Quadratic Assignment Problem: Theory and Algorithms

V. Deineko, E. Çela, 1998 .

Supermodularity on chains and complexity of maximum constraint satisfaction problems

V. Deineko, P. Jonsson, A. Krokhin, 2005 .

2VRP: a benchmark problem for small but rich VRPs

V. Deineko, Bettina Klinz, 2018, 1802.08042.

On the recognition of permuted Supnick and incomplete Monge matrices

V. Deineko, G. Woeginger, Rüdiger Rudolf, 1996, Acta Informatica.

Double-Tree Approximations for Metric TSP: Is the Best One Good Enough?

Vladimir G. Deineko, Alexander Tiskin, V. Deineko, 2004 .

Hardness of approximation of the discrete time-cost tradeoff problem

Gerhard J. Woeginger, Vladimir G. Deineko, V. Deineko, 2001, Oper. Res. Lett..

Linearizable special cases of the QAP

Gerhard J. Woeginger, Vladimir G. Deineko, Eranda Çela, 2014, J. Comb. Optim..

Special cases of the Euclidean Traveling Salesman

V. Deineko, 2018 .

Linearizable special cases of the QAP

V. Deineko, E. Çela, G. Woeginger, 2014, Journal of Combinatorial Optimization.

The approximability of MAX CSP with fixed-value constraints pdf

Peter Jonsson, Andrei A. Krokhin, Vladimir G. Deineko, 2006, JACM.

Which matrices are immune against the transportation paradox?

Gerhard J. Woeginger, Vladimir G. Deineko, Bettina Klinz, 2003, Discret. Appl. Math..

A study of exponential neighborhoods for the Travelling Salesman Problem and for the Quadratic Assignment Problem

Gerhard J. Woeginger, Vladimir G. Deı̆neko, V. Deineko, 2000, Math. Program..

The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case

Günter Rote, Vladimir G. Deineko, René van Dal, 1994, Inf. Process. Lett..

Group up to Learn Together: A System for Equitable Allocation of Students to Groups

F. O'Brien, V. Deineko, T. Ridd, 2009, CSEDU.

The Traveling Salesman Problem with Few Inner Points

Gerhard J. Woeginger, Michael Hoffmann, Yoshio Okamoto, 2004, COCOON.

Another well-solvable case of the QAP: Maximizing the job completion time variance

Gerhard J. Woeginger, Vladimir G. Deineko, Eranda Çela, 2012, Oper. Res. Lett..

On the dimension of simple monotonic games

Gerhard J. Woeginger, Vladimir G. Deineko, V. Deineko, 2006, Eur. J. Oper. Res..

2-Period Balanced Travelling Salesman Problem: a polynomially solvable case and heuristics

V. Deineko, Bettina Klinz, Meng Wang, 2022, 2203.06090.

A general approach to avoiding two by two submatrices

Gerhard J. Woeginger, Vladimir G. Deineko, Rüdiger Rudolf, 1994, Computing.

New special cases of the Quadratic Assignment Problem with diagonally structured coefficient matrices

Gerhard J. Woeginger, Vladimir G. Deineko, Eranda Çela, 2016, Eur. J. Oper. Res..

International Symposium on Combinatorial Optimization 2012 Program Committee Invited Plenary Speakers Organizing Committee Welcome to Co 2012

J. Gittins, C. McDiarmid, F. Rendl, 2022 .

Two hardness results for core stability in hedonic coalition formation games

Gerhard J. Woeginger, Vladimir G. Deineko, V. Deineko, 2013, Discret. Appl. Math..

Dynamic multi-period vehicle routing with touting

V. Deineko, M. Keskin, A. Strauss, 2023, Eur. J. Oper. Res..

A new family of scientific impact measures: The generalized Kosmulski-indices

Gerhard J. Woeginger, Vladimir G. Deineko, V. Deineko, 2009, Scientometrics.

The multi-stripe travelling salesman problem

Gerhard J. Woeginger, Vladimir G. Deineko, Eranda Çela, 2016, Annals of Operations Research.

Well-solvable cases of the QAP with block-structured matrices

Gerhard J. Woeginger, Vladimir G. Deineko, Eranda Çela, 2014, Discret. Appl. Math..

On the robust assignment problem under a fixed number of cost scenarios

Gerhard J. Woeginger, Vladimir G. Deineko, V. Deineko, 2006, Oper. Res. Lett..

A solvable case of the quadratic assignment problem

Gerhard J. Woeginger, Vladimir G. Deineko, V. Deineko, 1998, Oper. Res. Lett..

Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey

Gerhard J. Woeginger, Rainer E. Burkard, Jack A. A. van der Veen, 1998, SIAM Rev..

Travelling salesman paths on Demidenko matrices

V. Deineko, E. Çela, G. Woeginger, 2020, Discrete Applied Mathematics.

Another Look at the Shoelace TSP: The Case of Very Old Shoes

Gerhard J. Woeginger, Vladimir G. Deineko, V. Deineko, 2014, FUN.

On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices

Dvir Shabtay, George Steiner, Vladimir G. Deineko, 2011, J. Heuristics.

Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio pdf

Vladimir G. Deineko, Alexander Tiskin, V. Deineko, 2007, Electron. Notes Discret. Math..

On the Euclidean TSP with a permuted Van der Veen matrix

Rainer E. Burkard, Vladimir G. Deineko, R. Burkard, 2004, Inf. Process. Lett..

Special cases of the Euclidean Traveling Salesman Problem(Combinatorial Structure in Mathematical Models)

G. Rote, V. Deineko, R. Dal, 1993 .

Well-solvable special cases of the TSP : a survey

Gerhard J. Woeginger, Vladimir G. Deineko, Re Burkhard, 1996 .

Unbounded knapsack problems with arithmetic weight sequences

Gerhard J. Woeginger, Vladimir G. Deineko, V. Deineko, 2011, Eur. J. Oper. Res..

Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough?

Vladimir G. Deineko, Alexander Tiskin, V. Deineko, 2007, JEAL.

Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP

Vladimir G. Deineko, Alexander Tiskin, V. Deineko, 2007, WEA.

The bipartite travelling salesman problem: A pyramidally solvable case

V. Deineko, G. Woeginger, Bettina Klinz, 2023, Oper. Res. Lett..