| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Vladimir G. Deineko, Gerhard J. Woeginger |
A well-solvable special case of the bounded knapsack problem.  |
Oper. Res. Lett.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Gerhard J. Woeginger |
Unbounded knapsack problems with arithmetic weight sequences. |
European Journal of Operational Research |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Gerhard J. Woeginger |
Pinpointing the complexity of the interval min-max regret knapsack problem. |
Discrete Optimization |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Alexander Tiskin |
Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger |
Polygons with inscribed circles and prescribed side lengths. |
Appl. Math. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Gerhard J. Woeginger |
A new family of scientific impact measures: The generalized Kosmulski-indices. |
Scientometrics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger |
The complexity of computing the Muirhead-Dalton distance. |
Mathematical Social Sciences |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Alexander Tiskin |
Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough? |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Peter Jonsson, Mikael Klasson, Andrei A. Krokhin |
The approximability of MAX CSP with fixed-value constraints. |
J. ACM |
2008 |
DBLP DOI BibTeX RDF |
Complexity of approximation, maximum constraint satisfaction, dichotomy, Monge properties, supermodularity |
| 1 | Vladimir G. Deineko, Alexandre Tiskin |
Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Alexandre Tiskin |
Fast minimum-weight double-tree shortcutting for Metric TSP: Is the best one good enough? |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Alexandre Tiskin |
Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP. |
WEA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger |
Exact algorithms for the Hamiltonian cycle problem in planar graphs. |
Oper. Res. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger |
The traveling salesman problem with few inner points. |
Oper. Res. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Gerhard J. Woeginger |
On the robust assignment problem under a fixed number of cost scenarios. |
Oper. Res. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Gerhard J. Woeginger |
On the dimension of simple monotonic games. |
European Journal of Operational Research |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Gerhard J. Woeginger |
Well-solvable instances for the partition problem. |
Appl. Math. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Peter Jonsson, Mikael Klasson, Andrei A. Krokhin |
The approximability of MAX CSP with fixed-value constraints |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Gerhard J. Woeginger |
Some Problems around Traveling Salesmen, Dart Boards, and Euro-coins. |
Bulletin of the EATCS |
2006 |
DBLP BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger |
Four point conditions and exponential neighborhoods for symmetric TSP. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Alexandre Tiskin |
One-Sided Monge TSP Is NP-Hard. |
ICCSA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2005 |
DBLP DOI BibTeX RDF |
robotic-cell scheduling, permuted Monge matrix, traveling salesman problem, polynomial-time algorithm |
| 1 | Vladimir G. Deineko |
New exponential neighbourhood for polynomially solvable TSPs. |
Electronic Notes in Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Rainer E. Burkard, Vladimir G. Deineko |
On the Euclidean TSP with a permuted Van der Veen matrix. |
Inf. Process. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger |
The Traveling Salesman Problem with Few Inner Points. |
COCOON |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Gerhard J. Woeginger |
Complexity and approximability results for slicing floorplan designs. |
European Journal of Operational Research |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger |
Which matrices are immune against the transportation paradox? |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Gerhard J. Woeginger |
A comment on consecutive-2-out-of-n systems. |
Oper. Res. Lett. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Gerhard J. Woeginger |
Hardness of approximation of the discrete time-cost tradeoff problem. |
Oper. Res. Lett. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Gerhard J. Woeginger |
The Maximum Travelling Salesman Problem on Symmetric Demidenko Matrices. |
Discrete Applied Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Gerhard J. Woeginger |
A solvable case of the quadratic assignment problem. |
Oper. Res. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger |
The Travelling Salesman Problem on Permuted Monge Matrices. |
J. Comb. Optim. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Rainer E. Burkard, Vladimir G. Deineko |
On the Traveling Salesman Problem with a Relaxed Monge Matrix. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger |
Sometimes Travelling is Easy: The Master Tour Problem. |
SIAM J. Discrete Math. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Gerhard J. Woeginger |
The Convex-Hull-and-k-Line Travelling Salesman Problem. |
Inf. Process. Lett. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger |
On the Recognition of Permuted Supnick and Incomplete Monge Matrices. |
Acta Inf. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger |
The Travelling Salesman and the PQ-Tree. |
IPCO |
1996 |
DBLP DOI BibTeX RDF |
Euclidean travelling salesman problem, PQ-tree, Dynamic programming, Combinatorial optimization, Travelling salesman problem, Polynomial algorithm |
| 1 | Rainer E. Burkard, Vladimir G. Deineko |
Polynomially Solvable Cases of the Traveling Salesman Problem and a New Exponential Neighborhood. |
Computing |
1995 |
DBLP DOI BibTeX RDF |
subtour patching, Monge matrix, Traveling salesman problem |
| 1 | Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger |
Sometimes Travelling is Easy: The Master Tour Problem. |
ESA |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, René van Dal, Günter Rote |
The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case. |
Inf. Process. Lett. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger |
A general approach to avoiding two by two submatrices. |
Computing |
1994 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")