Efficiently solvable special cases of hard combinatorial optimization problems

Mathematical Programming, Series B

Volumn 79, Issue 1-3, 1997, Pages 55-69

  Burkard, Rainer E ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Polynomially solvable case; Quadratic assignment problem; Special case; Steiner tree problem; Travelling salesman problem

Indexed keywords

EID: 0004655290     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02614311     Document Type: Article

References (44)

1. K.S. Booth and G.S. Lueker, Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms, Journal of Computer and System Sciences 13 (1976) 335-379.
2. V.Y. Burdyuk and V.N. Trofimov, Generalization of the results of Gilmore and Gomory on the solution of the traveling salesman problem, Izw. Akad. Nauk SSSR, Tech. Kibernet., issue 3 (1976) 16-22 (in Russian); English translation in: Engineering Cybernetics 14 (1976) 12-18.
3. V.Y. Burdyuk and V.N. Trofimov, Generalization of the results of Gilmore and Gomory on the solution of the traveling salesman problem, Izw. Akad. Nauk SSSR, Tech. Kibernet., issue 3 (1976) 16-22 (in Russian); English translation in: Engineering Cybernetics 14 (1976) 12-18.
4. R.E. Burkard, Locations with spatial interactions: The quadratic assignment problem, in: R.L. Francis and P.B. Mirchandani, eds., Discrete Location Theory (Academic Press, New York, 1989) 387-437.
5. 3 Report 104, Institut für Mathematik, TU Graz, Austria, 1997.
6. R.E. Burkard, E. Çela, G. Rote and G. Wöginger, The quadratic assignment problem with an anti-Monge matrix and a Toeplitz matrix: Easy and hard cases, SFB Report 34, Institut für Mathematik, TU Graz, Austria, 1994; also: Mathematical Programming, to appear.
7. R.E. Burkard, E. Çela, G. Rote and G. Wöginger, The quadratic assignment problem with an anti-Monge matrix and a Toeplitz matrix: Easy and hard cases, SFB Report 34, Institut für Mathematik, TU Graz, Austria, 1994; also: Mathematical Programming, to appear.
8. R.E. Burkard and V.G. Deǐneko, Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood, Computing 54 (1995) 191-211.
9. R.E. Burkard, V.G. Deǐneko, R. van Dal, J.A.A. van der Veen and G.J. Wöginger, Well-solvable special cases of the travelling salesman problem: A survey, SFB Report 52, Institut für Mathematik, TU Graz, Austria, 1995.
10. R.E. Burkard, V.G. Deǐneko and G.J. Wöginger, The traveling salesman problem on permuted Monge matrices, SFB Report 31, Institut für Mathematik, TU Graz, Austria, 1995.
11. R.E. Burkard, V.G. Deǐneko and G.J. Wöginger, The traveling salesman and the PQ-tree, in: W.H. Cunningham, S.T. McCormick and M. Queyranne, eds., Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, Vol. 1084 (Springer, Berlin, 1996) 490-504.
12. R.E. Burkard and T. Dudás, Steiner minimum trees for equidistant points on two sides of an angle, Acta Cybernetica 12 (1996) 313-324.
13. R.E. Burkard, T. Dudás and T. Maier, Cut and patch Steiner trees for ladders, Discrete Mathematics 161 (1996) 53-61.
14. R.E. Burkard, B. Klinz and R. Rudolf, Perspectives of Monge properties in optimization, Discrete Applied Mathematics 70 (1996) 95-161.
15. R.E. Burkard and J.A.A. van der Veen, Universal conditions for algebraic traveling salesman problems to be efficiently solvable, Optimization 22 (1991) 787-814.
16. G. Christopher, M. Farach and M. Trick, The structure of circular decomposable metrics, in: J. Diaz and M. Serna, eds., Proceedings of ESA IV, Lecture Notes in Computer Science, Vol. 1136 (Springer, Berlin, 1996) 406-418.
17. F.R.K. Chung, M. Gardner and R.L. Graham, Steiner trees on a checkerboard, Mathematics Magazine 62 (1989) 83-96.
18. F.R.K. Chung and R.L. Graham, Steiner trees for ladders, Annals of Discrete Mathematics 2 (1978) 173-200.
19. G. Cornuéjols, D. Naddef and W.R. Pulleyblank, Halin graphs and the traveling salesman problem, Mathematical Programming 26 (1983) 287-294.
20. V.G. Deǐneko and V.L. Filonenko, On the reconstruction of specially structured matrices, Aktualnyje Problemy EVM i Programmirovanije, Dnepropetrovsk, DGU (1979) (in Russian).
21. V.G. Deǐneko, R. Rudolf and G.J. Wöginger, On the recognition of permuted Supnick and incomplete Monge matrices, Acta Informatica 33 (1996) 559-569.
22. V.G. Deǐneko, R. Rudolf and G.J. Wöginger, Sometimes travelling is easy: the master tour problem, in: P. Spirakis, ed., Proceedings of ESA III, Lecture Notes in Computer Science, Vol. 979 (Springer, Berlin, 1995) 128-141.
23. V.M. Demidenko, The traveling salesman problem with asymmetric matrices, Izv. Akad. Nauk. BSSR, Ser. Fiz.-mat. Nauk 1 (1979) 29-35 (in Russian).
24. D.Z. Du, F.K. Hwang and J.F. Weng, Steiner minimal trees on regular polygons, Discrete and Computational Geometry 2 (1987) 65-87.
25. D. Eppstein, Sequence comparison with mixed convex and concave costs, Journal of Algorithms 11 (1990) 85-101.
26. J.V. Ferreira and R.C. Guimaraes, A traveling salesman problem for the sequencing of duties in bus crew rotas, Journal of the Operational Research Society 46 (1995) 415-426.
27. N.E. Gaikov, On the minimization of a linear form on cycles, Minsk, 1980, Manuscript presented by Vesti Akad. Nauk BSSR, Ser. Fiz. mat. Nauk 4, 128, deposited in VINITI (AISTI), Moscow, No. 479-80 (in Russian).
28. P.C. Gilmore and R.E. Gomory, Sequencing a one state-variable machine: A solvable case of the traveling salesman problem, Operations Research 12 (1964) 655-679.
29. P.C. Gilmore, E.L. Lawler and D.B. Shmoys, Well-solved special cases, in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, eds., The Traveling Salesman Problem (Wiley, Chichester, UK, 1985) Chapter 4, 87-143.
30. M. Hallin, G. Melard and X. Milhaud, Permutational extreme values of autocorrelation coefficients and a Pitman test against serial dependence, Annals of Statistics 20 (1992) 523-534.
31. A.J. Hoffman, On simple linear programming problems, in: Convexity, Proceedings of Symposia in Pure Mathematics (AMS, Providence, RI, 1963) 317-327.
32. F.K. Hwang, A primer of the Euclidean Steiner problem, Annals of Operation Research 33 (1991) 73-84.
33. F.K. Hwang, D.S. Richards and P. Winter, The Steiner Tree Problem, Annals of Discrete Mathematics, Vol. 53 (North-Holland, Amsterdam, 1992).
34. K. Kalmanson, Edgeconvex circuits and the traveling salesman problem, Canadian Journal of Mathematics 27 (1975) 1000-1010.
35. G. Monge, Mémoires sur la théorie des déblais et des remblais, in: Histoire de l'Academie Royale des Science, Année M. DCCLXXXI, avec les Mémoires de Mathématique et de Physique, pour la même Année, Tirés des Registres de cette Académie, Paris (1781) 666-704.
36. J.K. Park, A special case of the n-vertex traveling salesman problem that can be solved in O(n) time, Information Processing Letters 40 (1991) 247-254.
37. R.D. Plante, T.J. Lowe and R. Chandrasekaran, The product traveling salesman problem: An application and solution heuristic, Operations Research 35 (1987) 772-783.
38. F. Rendl, Quadratic assignment problems on series-parallel digraphs, Zeitschrift für Operations Research 30 (1986) A161-A173.
39. R. Rudolf, Recognition of d-dimensional Monge arrays, Discrete Applied Mathematics 52 (1994) 71-82.
40. V.I. Sarvanov, On the complexity of minimizing a linear form on a set of cyclic permutations, Dokl. AN SSSR 253 (1980) 533-535 (in Russian); English translation in: Soviet Math. Dokl. 22, 118-120.
41. V.I. Sarvanov, On the complexity of minimizing a linear form on a set of cyclic permutations, Dokl. AN SSSR 253 (1980) 533-535 (in Russian); English translation in: Soviet Math. Dokl. 22, 118-120.
42. P. Winter, Steiner problem in Halin networks, Discrete Applied Mathematics 17 (1987) 281-294.
43. Q.F. Yang, R.E. Burkard, E. Cela and G. Wöginger, Hamiltonian cycles in circulant digraphs with two stripes, SFB Report 20, Institut für Mathematik, TU Graz, Austria, 1995; also: Discrete Mathematics, to appear.
44. Q.F. Yang, R.E. Burkard, E. Cela and G. Wöginger, Hamiltonian cycles in circulant digraphs with two stripes, SFB Report 20, Institut für Mathematik, TU Graz, Austria, 1995; also: Discrete Mathematics, to appear.