Vladimir G. Deineko

According to our database1, Vladimir G. Deineko
  • authored at least 60 papers between 1994 and 2016.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
Linearizable special cases of the QAP.
J. Comb. Optim., 2016

The multi-stripe travelling salesman problem.
CoRR, 2016

2015
Well-solvable cases of the QAP with block-structured matrices.
Discrete Applied Mathematics, 2015

A New Tractable Case of the QAP with a Robinson Matrix.
Proceedings of the Combinatorial Optimization and Applications, 2015

2014
Two hardness results for Gamson's game.
Social Choice and Welfare, 2014

Four-point conditions for the TSP: The complete complexity classification.
Discrete Optimization, 2014

Linearizable special cases of the QAP.
CoRR, 2014

Another Look at the Shoelace TSP: The Case of Very Old Shoes.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013
Uniqueness in quadratic and hyperbolic 0-1 programming problems.
Oper. Res. Lett., 2013

Two hardness results for core stability in hedonic coalition formation games.
Discrete Applied Mathematics, 2013

Uniqueness in quadratic and hyperbolic 0-1 programming problems.
CoRR, 2013

Complexity and in-approximability of a selection problem in robust optimization.
4OR, 2013

2012
Another well-solvable case of the QAP: Maximizing the job completion time variance.
Oper. Res. Lett., 2012

The x-and-y-axes travelling salesman problem.
European Journal of Operational Research, 2012

2011
A well-solvable special case of the bounded knapsack problem.
Oper. Res. Lett., 2011

On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices.
J. Heuristics, 2011

Unbounded knapsack problems with arithmetic weight sequences.
European Journal of Operational Research, 2011

2010
Pinpointing the complexity of the interval min-max regret knapsack problem.
Discrete Optimization, 2010

2009
A new family of scientific impact measures: The generalized Kosmulski-indices.
Scientometrics, 2009

The complexity of computing the Muirhead-Dalton distance.
Mathematical Social Sciences, 2009

Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough?
ACM Journal of Experimental Algorithmics, 2009

Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio.
Electronic Notes in Discrete Mathematics, 2009

Polygons with inscribed circles and prescribed side lengths.
Appl. Math. Lett., 2009

2008
The approximability of MAX CSP with fixed-value constraints.
J. ACM, 2008

2007
Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio
CoRR, 2007

Fast minimum-weight double-tree shortcutting for Metric TSP: Is the best one good enough?
CoRR, 2007

Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP.
Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

2006
On the robust assignment problem under a fixed number of cost scenarios.
Oper. Res. Lett., 2006

Exact algorithms for the Hamiltonian cycle problem in planar graphs.
Oper. Res. Lett., 2006

The traveling salesman problem with few inner points.
Oper. Res. Lett., 2006

On the dimension of simple monotonic games.
European Journal of Operational Research, 2006

Some Problems around Traveling Salesmen, Dart Boards, and Euro-coins.
Bulletin of the EATCS, 2006

The approximability of MAX CSP with fixed-value constraints
CoRR, 2006

Well-solvable instances for the partition problem.
Appl. Math. Lett., 2006

Four point conditions and exponential neighborhoods for symmetric TSP.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

One-Sided Monge TSP Is NP-Hard.
Proceedings of the Computational Science and Its Applications, 2006

2005
Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices.
J. Comb. Optim., 2005

2004
On the Euclidean TSP with a permuted Van der Veen matrix.
Inf. Process. Lett., 2004

New exponential neighbourhood for polynomially solvable TSPs.
Electronic Notes in Discrete Mathematics, 2004

The Traveling Salesman Problem with Few Inner Points.
Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003
Complexity and approximability results for slicing floorplan designs.
European Journal of Operational Research, 2003

Which matrices are immune against the transportation paradox?
Discrete Applied Mathematics, 2003

2001
A comment on consecutive-2-out-of-n systems.
Oper. Res. Lett., 2001

Hardness of approximation of the discrete time-cost tradeoff problem.
Oper. Res. Lett., 2001

2000
A study of exponential neighborhoods for the Travelling Salesman Problem and for the Quadratic Assignment Problem.
Math. Program., 2000

The Maximum Travelling Salesman Problem on Symmetric Demidenko Matrices.
Discrete Applied Mathematics, 2000

1999
Erratum: The Travelling Salesman and the PQ-Tree.
Math. Oper. Res., 1999

1998
Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey.
SIAM Review, 1998

Sometimes Travelling is Easy: The Master Tour Problem.
SIAM J. Discrete Math., 1998

A solvable case of the quadratic assignment problem.
Oper. Res. Lett., 1998

The Travelling Salesman and the PQ-Tree.
Math. Oper. Res., 1998

The Travelling Salesman Problem on Permuted Monge Matrices.
J. Comb. Optim., 1998

On the Traveling Salesman Problem with a Relaxed Monge Matrix.
Inf. Process. Lett., 1998

1996
The Convex-Hull-and-k-Line Travelling Salesman Problem.
Inf. Process. Lett., 1996

On the Recognition of Permuted Supnick and Incomplete Monge Matrices.
Acta Inf., 1996

The Travelling Salesman and the PQ-Tree.
Proceedings of the Integer Programming and Combinatorial Optimization, 1996

1995
Polynomially Solvable Cases of the Traveling Salesman Problem and a New Exponential Neighborhood.
Computing, 1995

Sometimes Travelling is Easy: The Master Tour Problem.
Proceedings of the Algorithms, 1995

1994
The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case.
Inf. Process. Lett., 1994

A general approach to avoiding two by two submatrices.
Computing, 1994


  Loading...