Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Rainer, E. Burkard
1990.
Special cases of travelling salesman problems and heuristics.
Acta Mathematicae Applicatae Sinica,
Vol. 6,
Issue. 3,
p.
273.
Burkard, R.E.
and
Van Der Veen, J.A.A.
1991.
Universal conditions for algebraic travelling salesman problems to be efficiently solvable.
Optimization,
Vol. 22,
Issue. 5,
p.
787.
Warren, Richard H.
1994.
Special cases of the traveling salesman problem.
Applied Mathematics and Computation,
Vol. 60,
Issue. 2-3,
p.
171.
van der Veen, Jack A. A.
1994.
A New Class of Pyramidally Solvable Symmetric Traveling Salesman Problems.
SIAM Journal on Discrete Mathematics,
Vol. 7,
Issue. 4,
p.
585.
Deineko, Vladimir G.
Rudolf, Rüdiger
and
Woeginger, Gerhard J.
1995.
Algorithms — ESA '95.
Vol. 979,
Issue. ,
p.
128.
Christopher, George
Farach, Martin
and
Trick, Michael
1996.
Algorithms — ESA '96.
Vol. 1136,
Issue. ,
p.
486.
Burkard, Rainer E.
Klinz, Bettina
and
Rudolf, Rüdiger
1996.
Perspectives of Monge properties in optimization.
Discrete Applied Mathematics,
Vol. 70,
Issue. 2,
p.
95.
Burkard, Rainer E.
1997.
Efficiently solvable special cases of hard combinatorial optimization problems.
Mathematical Programming,
Vol. 79,
Issue. 1-3,
p.
55.
Deĭneko, V. G.
Van der Veen, J. A.
Rudolf, R.
and
Woeginger, G. J.
1997.
Three easy special cases of the euclidean travelling salesman problem.
RAIRO - Operations Research,
Vol. 31,
Issue. 4,
p.
343.
Demidenko, V.M
and
Rudolf, R
1997.
A Note On Kalmanson Matrices∗.
Optimization,
Vol. 40,
Issue. 3,
p.
285.
Chepoi, Victor
and
Fichet, Bernard
1998.
A Note on Circular Decomposable Metrics.
Geometriae Dedicata,
Vol. 69,
Issue. 3,
p.
237.
Deuineko, Vladimir G.
Rudolf, Rüdiger
and
Woeginger, Gerhard J.
1998.
Sometimes Travelling is Easy: The Master Tour Problem.
SIAM Journal on Discrete Mathematics,
Vol. 11,
Issue. 1,
p.
81.
Deineko, Vladimir G
and
Woeginger, Gerhard J
1998.
A solvable case of the quadratic assignment problem.
Operations Research Letters,
Vol. 22,
Issue. 1,
p.
13.
Burkard, Rainer E.
Deineko, Vladimir G.
van Dal, René
van der Veen, Jack A. A.
and
Woeginger, Gerhard J.
1998.
Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey.
SIAM Review,
Vol. 40,
Issue. 3,
p.
496.
Burkard, Rainer E.
and
Deĭneko, Vladimir G.
1998.
On the traveling salesman problem with a relaxed Monge matrix.
Information Processing Letters,
Vol. 67,
Issue. 5,
p.
231.
Klinz, Bettina
and
Woeginger, Gerhard J.
1999.
The Steiner Tree Problem in Kalmanson Matrices and in Circulant Matrices.
Journal of Combinatorial Optimization,
Vol. 3,
Issue. 1,
p.
51.
Balas, E.
1999.
New classes of efficiently solvable generalized Traveling Salesman Problems.
Annals of Operations Research,
Vol. 86,
Issue. 0,
p.
529.
Deı̆neko, Vladimir G.
and
Woeginger, Gerhard J.
2000.
The Maximum Travelling Salesman Problem on symmetric Demidenko matrices.
Discrete Applied Mathematics,
Vol. 99,
Issue. 1-3,
p.
413.
KABADI, SANTOSH N.
2001.
GENERALISATIONS OF THE GILMORE-GOMORY TRAVELING SALESMAN PROBLEM AND THE GILMORE-GOMORY SCHEME: A SURVEY.
International Game Theory Review,
Vol. 03,
Issue. 02n03,
p.
213.
Woeginger, Gerhard J.
2002.
Operations Research Proceedings 2001.
p.
293.