Vladimir G. Deineko

发表

Erratum: The Travelling Salesman and the PQ-Tree

Gerhard J. Woeginger, Rainer E. Burkard, Vladimir G. Deineko, 1999, Math. Oper. Res..

On the dimension of simple monotonic games

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

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..

The Maximum Travelling Salesman Problem on Symmetric Demidenko Matrices

Gerhard J. Woeginger, Vladimir G. Deineko, 2000, Discret. Appl. Math..

A well-solvable special case of the bounded knapsack problem

Gerhard J. Woeginger, Vladimir G. Deineko, 2011, Oper. Res. Lett..

Hardness of approximation of the discrete time-cost tradeoff problem

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

The Convex-Hull-and-k-Line Travelling Salesman Problem

Gerhard J. Woeginger, Vladimir G. Deineko, 1996, Inf. Process. Lett..

New exponential neighbourhood for polynomially solvable TSPs

Vladimir G. Deineko, 2004, Electron. Notes Discret. Math..

Unbounded knapsack problems with arithmetic weight sequences

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

Complexity and approximability results for slicing floorplan designs

Gerhard J. Woeginger, Vladimir G. Deineko, 2003, Eur. J. Oper. Res..

A comment on consecutive-2-out-of-n systems

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

The Traveling Salesman Problem with Few Inner Points

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

Some Problems around Traveling Salesmen, Dart Boards, and Euro-coins

Gerhard J. Woeginger, Vladimir G. Deineko, 2006, Bull. EATCS.

Uniqueness in quadratic and hyperbolic 0-1 programming problems pdf

Gerhard J. Woeginger, Vladimir G. Deineko, Bettina Klinz, 2013, Oper. Res. Lett..

Pinpointing the complexity of the interval min-max regret knapsack problem

Gerhard J. Woeginger, Vladimir G. Deineko, 2010, Discret. Optim..

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 recognition of permuted Supnick and incomplete Monge matrices

Gerhard J. Woeginger, Vladimir G. Deineko, Rüdiger Rudolf, 2009, Acta Informatica.

Two hardness results for core stability in hedonic coalition formation games

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

A New Tractable Case of the QAP with a Robinson Matrix

Gerhard J. Woeginger, Vladimir G. Deineko, Eranda Çela, 2015, COCOA.

Well-solvable instances for the partition problem

Gerhard J. Woeginger, Vladimir G. Deineko, 2006, Appl. Math. Lett..

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..

Complexity and in-approximability of a selection problem in robust optimization

Gerhard J. Woeginger, Vladimir G. Deineko, 2013, 4OR.

The complexity of computing the Muirhead-Dalton distance

Gerhard J. Woeginger, Vladimir G. Deineko, Bettina Klinz, 2009, Math. Soc. Sci..

Well-solvable special cases of the TSP : a survey

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

Exact algorithms for the Hamiltonian cycle problem in planar graphs

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

The Travelling Salesman Problem on Permuted Monge Matrices

Gerhard J. Woeginger, Rainer E. Burkard, Vladimir G. Deineko, 1998, J. Comb. Optim..

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

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

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..

A general approach to avoiding two by two submatrices

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

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..

Two hardness results for Gamson’s game

Gerhard J. Woeginger, Vladimir G. Deineko, 2014, Soc. Choice Welf..

Linearizable special cases of the QAP

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

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

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

Sometimes Travelling is Easy: The Master Tour Problem

Gerhard J. Woeginger, Vladimir G. Deineko, Rüdiger Rudolf, 1995, ESA.

The x-and-y-axes travelling salesman problem

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

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

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

On the Euclidean TSP with a permuted Van der Veen matrix

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

Four-point conditions for the TSP: The complete complexity classification

Gerhard J. Woeginger, Vladimir G. Deineko, Alexander Tiskin, 2014, Discret. Optim..

Travelling salesman paths on Demidenko matrices pdf

Gerhard J. Woeginger, Vladimir G. Deineko, Eranda Çela, 2020, ArXiv.

Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood

Rainer E. Burkard, Vladimir G. Deineko, 2005, Computing.

The multi-stripe travelling salesman problem

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

Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices

George Steiner, Vladimir G. Deineko, Zhihui Xue, 2005, J. Comb. Optim..

Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP

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

One-Sided Monge TSP Is NP-Hard

Vladimir G. Deineko, Alexander Tiskin, 2006, ICCSA.

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.

A solvable case of the quadratic assignment problem

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

The Travelling Salesman and the PQ-Tree

Gerhard J. Woeginger, Rainer E. Burkard, Vladimir G. Deineko, 1998, Math. Oper. Res..

Four point conditions and exponential neighborhoods for symmetric TSP

Gerhard J. Woeginger, Vladimir G. Deineko, Bettina Klinz, 2006, SODA '06.

Which matrices are immune against the transportation paradox?

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

The approximability of MAX CSP with fixed-value constraints pdf

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

Sometimes Travelling is Easy: The Master Tour Problem

Gerhard J. Woeginger, Vladimir G. Deineko, Rüdiger Rudolf, 1998, SIAM J. Discret. Math..

The Travelling Salesman and the PQ-Tree

Gerhard J. Woeginger, Rainer E. Burkard, Vladimir G. Deineko, 1996, IPCO.

On the Traveling Salesman Problem with a Relaxed Monge Matrix

Rainer E. Burkard, Vladimir G. Deineko, 1998, Inf. Process. Lett..

The Traveling Salesman Problem with Few Inner Points

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

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

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

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

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