List of Publications

Books

1. R.E. Burkard,
   "Methoden der ganzzahligen Optimierung", Springer-Verlag, Wien-New York 1972, 292 p.
   

2. R.E. Burkard and U. Derigs,
   "Assignment and Matching Problems: Solution Methods with FORTRAN-Programs", LN in Economics and Mathematical Systems, Vol. 184, Berlin-New York: Springer 1980.
   

3. R.E. Burkard,
   "Graph Algorithms in Computer Science", HyperCOSTOC Computer Science, Vol. 36, HOFBAUER Publ., Wiener Neustadt, AUSTRIA 1989 (with 6 diskettes).

4. R.E. Burkard, P. Deuflhard, A. Jameson, J.-L. Lions, G. Strang
   "Computational Mathematics Driven by Industrial Problems" (Lecture Notes in Mathematics Vol. 1739), Lectures given at the 1-st session of the Centro Internazionale Matematico Estivo (C.I.M.E.) held in Martina Franca, Italy, June 21-27, 1999, V. Capasso, H. Engl and J. Periaux (eds.), Springer, Berlin Heidelberg New York 2000 (ISBN 3-540-67782-8).

5. R.E. Burkard, M. Dell'Amico, S. Martello
   "Assignment Problems", SIAM Philadelphia, 2009 (ISBN 978-0-898716-63-4).

6. R.E. Burkard, M. Dell'Amico, S. Martello
   "Assignment Problems", Revised Reprint, SIAM Philadelphia, 2012 (ISBN 978-1-611972-22-1).

7. R.E. Burkard, U.T. Zimmermann
   "Einführung in die Mathematische Optimierung", Springer Verlag Berlin-Heidelberg, 2012 (ISBN 978-3-642-28672-8).

Coedited Books

1. R. E. Burkard and Th. Ellinger (Eds.),
   "Methods of Operation Research", Vol. 40 and 41, (ISBN 3-445-02110-4), 1980.
   

2. R. E. Burkard, R. A. Cuninghame-Green and U. Zimmermann (Eds.),
   "Algebraic and Combinatorial Methods in Operations Research" (Annals of Discrete Mathematics Vol. 19), North Holland, Amsterdam, 1984.
   

3. R. E. Burkard, T. Ibaraki and M. Queyranne (Eds.),
   "Mathematics of Industrial Systems I" (Annals of Operations Research Vol. 57), Baltzer, Amsterdam 1995.
   

4. R. E. Burkard, T. Ibaraki and M. Queyranne (Eds.),
   "Mathematics of Industrial Systems II" (Annals of Operations Research Vol. 69), Baltzer, Amsterdam 1997.
   

5. R. E. Burkard and G. J. Woeginger (Eds.),
   "Algorithms - ESA '97" (Lecture Notes in Computer Science Vol. 1284 ), Springer, Berlin 1997 (ISBN 3-540-63 397-9).
   

6. R. E. Burkard, T. Ibaraki and W. R. Pulleyblank (Eds.),
   "Mathematics of Industrial Systems III" (Annals of Operations Research Vol. 76), Baltzer, Amsterdam 1998.
   

7. R. E. Burkard, G. Cornuéjols and G. J. Woeginger (Eds.),
   "Integer Programming and Combinatorial Optimization" (Lecture Notes in Computer Science Vol. 1610 ), Springer, Berlin 1999 (ISBN 3-540-66 019-4).
   

8. R. E. Burkard, W. Maass and Peter Weibel (Eds.),
   "Zur Kunst des formalen Denkens", Passagen Verlag, Wien 2000 (ISBN 3-85165-358-0), (in German).
   

9. R. E. Burkard, T. Ibaraki, W. R. Pulleyblank, E. Santibanez-Gonzalez (Eds.),
   "Mathematics of Industrial Systems IV" (Annals of Operations Research Vol. 96), Baltzer, Bussum (Netherlands) 2000.
   

10. R. E. Burkard, T. Ibaraki, W. R. Pulleyblank, H. Blank, G. Mitra, S. Noble (Eds.),
    "Mathematics of Industrial Systems V" (Annals of Operations Research Vol. 107), Kluwer Academic Publishers, Dortrecht (Netherlands), 2001.
    

11. P. Pardalos, A. Migdalas, R.E. Burkard (Eds.),
    "Combinatorial and Global Optimization", Series on Applied Mathematics, Volume 14, World Scientific, New Jersey, London, Singapore, Hong Kong, 2002.

Edited special issues of journals

1. R.E. Burkard (ed.)
   Special Issue on Combinatorial Optimization, Computing, Volume 63, Issue 4, 1999.

2. R.E. Burkard, M. Labbé, M.T. Ramos and J. Sicilia (eds.),
   Feature Issue on ECCO X: Advances in Theory and Practice of Combinatorial Optimization, European Journal of Operational Research, Volume 123, Issue 2, 1999.
   

Scientific Articles

1. R.E. Burkard,
   Zur gleichmäßigen Gleichverteilung von Polynomwerten modulo , Sitzungsberichte Math. Naturw. Kl. Österr. Akademie der Wissenschaften 177, 1968, 395-406.

2. R.E. Burkard,
   Untersuchungen zum Optimum-Mix-Problem, Unternehmensforschung 14, 1970, 81-88.

3. R.E. Burkard,
   Das Optimum Mix Problem, Op. Res. Verfahren 8, 1970, 60-63.

4. R.E. Burkard,
   Kriterien, wann arithmetische Reihen Zahlen enthalten, die sich als Summe zweier Quadrate darstellen lassen, Rend. Circ. Mat. Palermo, Ser. II, Vol. 20, 1971, 292-296.

5. R.E. Burkard,
   Iterierte zahlentheoretische Funktionen, Math.-Phys. Semesterber 19, 1972, 235-253.

6. R.E. Burkard,
   A method for mixed integer convex programming, in Proceedings of the 4th Internat. Conference on Probability Theory, Brasov 1971, (B. Bereanu et al., eds.), Bucharest 1973, 497-504.

7. R.E. Burkard,
   Die Störungsmethode zur Lösung quadratischer Zuordnungsprobleme, Op. Res. Verfahren 16, 1973, 89-108.

8. R.E. Burkard and B. Genser,
   Zur Methode der approximierenden Optimierung, Math. Operationsforschung und Statistik 5, 1974, 23-33.

9. R.E. Burkard,
   Quadratische Bottleneckprobleme, Op. Res. Verfahren 18, 1974, 26-41.

10. R.E. Burkard,
    Numerische Erfahrungen mit Summen- und Bottleneck-Zuordnungsproblemen, in Numerische Methoden bei graphentheoretischen und kombinatorischen Problemen, (L. Collatz, G. Meinardus and H. Werner, eds.), Birkhäuser Verlag Basel-Stuttgart, ISNM Bd. 29, 1975, 9-25.

11. R.E. Burkard,
    Kombinatorische Optimierung in Halbgruppen, in Optimization and Optimal Control, (R. Bulirsch, W. Oettli and J. Stoer, eds.), Springer LN in Math. 477, 1975, 1-17.

12. R.E. Burkard,
    Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme, Zeitschrift für Operations Research 19, 1975, 183-193.

13. R.E. Burkard and H. Enge,
    Algorithmus 25: Verfahren zur gemischt-ganzzahligen konvexen Optimierung, Computing 14, 1975, 389-396.

14. R.E. Burkard,
    Flüsse in Netzwerken mit allgemeinen Kosten, in Graphen, Algorithmen, Datenstrukturen (Applied Computer Science, Vol. 4), (H. Noltemeier, ed.), Hanser Verlag, München 1976, 123-134.

15. R.E. Burkard,
    Lineare Optimierung im Schulunterricht, in Anwendungsorientierte Mathematik in der Sekundarstufe II, (W. Dörfler and R. Fischer, eds.), Klagenfurt: J. Heyn, 1976, 39-58.

16. R.E. Burkard, W. Hahn and U. Zimmermann,
    An algebraic approach to assignment problems, Math. Programming 12, 1977, 318-327.

17. R.E. Burkard, H.Hamacher and U. Zimmermann,
    Flußprobleme mit allgemeinen Kosten, in Numerische Methoden bei Optimierungsaufgaben, Vol. 3, (L. Collatz, G. Meinardus and W. Wetterling, eds.), Birkhäuser, Basel-Stuttgart, ISNM Vol. 36, 1977, 9-22.

18. R.E. Burkard and J. Offermann,
    Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme, Zeitschrift für Operations Research 21, 1977, B121-B132.

19. R.E. Burkard,
    Zur Bestimmung von Schreibmaschinentastaturen durch quadratische Zuordnungsprobleme, Op. Res. Verfahren 25, 1977, 144-146 (Extended Abstract).

20. R.E. Burkard, H. Hamacher and U. Zimmermann,
    Einige Bemerkungen zum algebraischen Flußproblem, Op. Res. Verf. 23, 1977, 252-254.

21. R.E. Burkard and K.H. Stratmann,
    Numerical investigations on quadratic assignment problems, Naval Res. Log. Quarterly 25 1978, 129-148.

22. R.E. Burkard,
    A general Hungarian method for the algebraic transportation problem, Discrete Math. 22, 1978, 219-232.

23. R.E. Burkard,
    The solution of algebraic assignment and transportation problems, in Optimization and Operations Research, (R. Henn, B. Korte and W. Oettli, eds.), Springer LN in Econ. and Math. Systems, Vol. 157, 1978, 55-65.

24. R.E. Burkard,
    Travelling salesman and assignment problems: A survey, Annals of Discrete Maths. 4, 1979, 193-215.

25. R.E. Burkard,
    Über eine Anwendung algebraischer Transportprobleme bei Reihenfolgeproblemen, in Numerische Verfahren bei kombinatorischen und graphentheoretischen Problemen, Vol. 2, (L. Collatz, G. Meinardus and W. Wetterling, eds.), Birkhäuser Verlag 1979, 22-36.

26. R.E. Burkard,
    An application of algebraic transportation problems to scheduling problems, in Proceedings of the Polish-Danish Mathematical Programming Seminar, (J. Krarup and S. Walukiewicz, eds.), Polish Academy of Sciences, Jan. 1979, 124-138.

27. R.E. Burkard,
    Remarks on some scheduling problems with algebraic objective functions, Operations Research Verfahren 32, 1979, 63-77.

28. R.E. Burkard and U. Zimmermann,
    Weakly admissible transformations for solving algebraic assignment and transportation problems, Mathematical Programming Study 12, 1980, 1-18.

29. R.E. Burkard and K. Fröhlich,
    Some remarks on three dimensional assignment problems, Op. Res. Verfahren 36, 1980, 31-36.

30. R.E. Burkard and P.L. Hammer,
    A note on Hamiltonian split graphs, J. Combinatorial Theory, Ser. B 28, 245-248.

31. R.E. Burkard,
    Subgradient methods in combinatorial optimization, in Discrete Structures and Algorithms, (U. Pape, ed.), Hanser Verlag München 1980, 141-151.

32. R.E. Burkard,
    Un planteo algebraico para funciones objetivo en la optimizacion combinatoria, Rev. de Informatica e Investigacion Operativa 39, 1980, 11-32.

33. R.E. Burkard and H. Hamacher,
    Minimal cost flows in regular matroids, Mathematical Programming Study 14, 1981, 32-47.

34. R.E. Burkard, H. Keiding, J. Krarup and P. M. Pruznan,
    A relationship between optimality and efficiency in multi criteria 0-1 programming problems, Computers and Operations Research 8, 1981, 241-247.

35. R.E. Burkard and U. Derigs,
    Admissible transformations and their applications to matching problems, in Studies on Graphs and Discrete Programming, (P. Hansen, ed.), North Holland, Amsterdam, 1981, 23-38.

36. R.E. Burkard and U. Zimmermann,
    Combinatorial optimization in linearly ordered semimodules: A survey. In Modern Applied Mathematics (B. Korte, ed.), North Holland, Amsterdam, 1982, 392-436.

37. R.E. Burkard, J. Krarup and P. M. Pruznan,
    Efficiency and optimality in minisum minimax 0-1 programming problems, J. Operat. Res. Soc. 33, 1982, 137-151; Extended Abstract in Methods of Operations Research 40, 1981, 361-366.

38. R.E. Burkard and U. Fincke,
    On random quadratic bottleneck assignment problems, Mathematical Programming 23, 1982, 227-232.

39. R.E. Burkard, H. Hamacher and J. Tind,
    On abstract duality in mathematical programming, Zeitschrift für Operations Research 26, 1982, 197-209.

40. R.E. Burkard and U. Fincke,
    The asymptotic probabilistic behaviour of quadratic sum assignment problems, Zeitschrift für Operations Research 27, 1983, 73-81.

41. R.E. Burkard and T. Bönniger,
    A heuristic for quadratic Boolean programs with applications to quadratic assignment problems, European Journal of Operational Research 13, 1983, 374-386.

42. R.E. Burkard,
    Some recent advances in quadratic assignment problems, in Mathematical Programming ( R. W. Cottle, M. L. Kelmanson and B. Korte, eds.), North Holland 1983, 53-68, Proceedings of the Internat. Congress on Math. Programming, Rio de Janeiro 1981.

43. R.E. Burkard,
    Quadratic assignment problems, European Journal of Operational Research 15, 1984, 283-289.

44. R.E. Burkard, J. Krarup and P. M. Pruznan,
    Some relationships between multicriteria and parametric discrete optimization problems with bottleneck objectives, Math. Operationsforschung und Statistik, Ser. Optimization 15, 1984, 389-395.

45. R.E. Burkard and F. Rendl,
    A thermodynamically motivated simulation procedure for combinatorial optimization problems, European Journal of Operational Research 17, 1984, 169-174.

46. R.E. Burkard and R.A. Cuninghame-Green,
    Eigenfunctions and optimal orbits, J. Comp. Appl. Math. 11, 1984, 83-94.

47. R.E. Burkard, H. Hamacher and J. Tind,
    On general decomposition schemes in mathematical programming, Math. Programming Study 24, 1985, 238-252.

48. R.E. Burkard and U. Fincke,
    Probabilistic asymptotic properties of some combinatorial optimization problems, Discrete Applied Mathematics 12, 1985, 21-29.

49. R.E. Burkard, R. Euler and R. Grommes,
    On the facial structure of polytopes related to the planar 3-dimensional assignment problem, Methods of Operations Research 49, 1985, 147-159.

50. R.E. Burkard,
    Time-slot assignment for TDMA-systems, Computing 35, 1985, 99-112.

51. R.E. Burkard, R. Euler, and R. Grommes,
    On latin squares and the facial structure of related polytopes, Discrete Mathematics 62, 1986, 155-181.

52. R.E. Burkard,
    Optimal schedules for periodically recurring events, Discr. Appl. Mathematics 15, 1986, 167-180.

53. R.E. Burkard,
    Assignment problems: recent solution methods and applications, in System Modelling and Optimization (A. Prékopa, J. Szelezsán and B. Strazicky, eds.), Springer LN in Control and Information Sciences, Vol. 84, 1986, 153-169.

54. R.E. Burkard, G. Finke and F. Rendl,
    Quadratic assignment problems, Annals of Discrete Mathematics, Vol. 31, 1987, 61-82.

55. R.E. Burkard and R. Cuninghame-Green,
    Saddlepoints in group and semigroup minimization, Optimization 19, 1988, 451-459.

56. R.E. Burkard,
    Locations with spatial interactions: The quadratic assignment problem. In Discrete Location Theory (R. L. Francis and P. B. Mirchandani, eds.), Academic Press 1989, 387-437.

57. R.E. Burkard,
    Ganzzahlige Optimierung. In Grundlagen des Operations Research (T. Gal, ed.), Vol. II, 361-443, Springer Verlag, Berlin 1987, 2. Aufl. Berlin 1989.

58. R.E. Burkard and A. Korsnikov,
    On the dimension of polytopes of planar three-index transportation problems, Optimization 20, 1989, 107-116.

59. R.E. Burkard, B. Fruhwirth and G. Rote,
    Approximation of convex curves with application to the bicriterial min cost flow problem, European Journal of Operational Research 42, 1989, 326-338.

60. R.E. Burkard, G. Rote, G. Ruhe, and N. Sieber,
    Algorithmische Untersuchungen zu bikriteriellen kostenminimalen Flüssen in Netzwerken, Wissenschaftliche Zeitschrift der Technischen Hochschule Leipzig 13 , 1989, Heft 6, 333-341.

61. R.E. Burkard, P. Brucker and J. Hurink,
    Cyclic schedules for r irregularly occurring events, J. Comp. Applied Math. 30, 1990, 173-189.

62. R.E. Burkard and Yao En-yu,
    Constrained partitioning problems, Discrete Applied Mathematics 28, 1990, 21-34.

63. R.E. Burkard,
    Special cases of travelling salesman problems and heuristics, Acta Mathematicae Applicatae Sinica 6, 1990, 273-288.

64. R.E. Burkard, G. Rote, E.Y. Yao and Z.L. Yu,
    Shortest polygonal lines in space, Computing 45, 1990, 51-68.

65. R.E. Burkard, H. Hamacher and G. Rote,
    Sandwich approximation of univariate convex functions with an application to separable convex programming, Naval Research Logistics Quarterly 38, 1991, 911-924.

66. R.E. Burkard and W. Sandholzer,
    Efficiently solvable special cases of bottleneck travelling salesman problems, Discrete Applied Mathematics 32, 1991, 61-76.

67. R.E. Burkard and F. Rendl,
    Lexicographic bottleneck problems, Operations Research Letters 10, 1991, 303-308.

68. R.E. Burkard,
    Time Division Multiple Access systems and matrix decomposition, in Proceedings of the Fourth European Conference on Mathematics in Industry (H.J. Wacker and W. Zulehner, eds.), Teubner, Stuttgart, 1991, 35-46.

69. R.E. Burkard, P.T. Thach and W. Oettli,
    Mathematical programs with a two-dimensional reverse convex constraint, J. Global Optimization 1, 1991, 145-154.

70. R.E. Burkard,
    Shortest path algorithms. In Concise Encyclopedia of Traffic and Transportation Systems (CETTS) (M. Papageorgiou, ed.), Pergamon Press, Oxford, 1991, 461-468.

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

72. R.E. Burkard and H.A. Eiselt,
    Reshipments and overshipments in transportation problems with minimax objective, Operations Research Spektrum 13, 1991, 133-140.

73. R.E. Burkard, S. Karisch and F. Rendl,
    QAPLIB -- A quadratic assignment problem library, EJOR 55, 1991, 115-119.
    

74. R.E. Burkard,
    An analysis of complex combinatorial optimization problems from practice, in KOI 1992 Proceedings of the 2nd Conference on Operations Research, Rovinj 1992, (V. Balrovec, Lj. Martic' and L. Neralic', eds.), 3-13.

75. R.E. Burkard and R. Rudolf,
    Computational investigations on 3-dimensional axial assignment problems, Belgian J. of Op. Res., Stat. and Comp. Sc. 32, 1993, 85-98.

76. R.E. Burkard,
    Convexity and discrete optimization. Chapter 2.8 in Handbook of Convex Geometry (P. Gruber and J. Wills, eds.), North Holland, Amsterdam, 675-698, 1993. Extended Abstract in Operations Research '91 (P. Gritzmann, R. Hettich, R. Horst and E. Sachs, eds.) Heidelberg: Physica Verlag, 1-4.

77. R.E. Burkard, K. Dlaska and B. Klinz,
    The Quickest Flow Problem, ZOR Methods and Models of Operations Research 37, 1993, 31-58.

78. J. Blazewicz, R.E. Burkard, G. Finke and G.J. Woeginger,
    Vehicle Scheduling in Two-Cycle Flexible Manufactoring Systems, Mathl. Comput. Modelling 20, 1994, 19-31.

79. R.E. Burkard, E. Çela and B. Klinz,
    On the Biquadratic Assignment Problem, in Quadratic Assignment and Related Problems (P.M. Pardalos and H. Wolkowicz, eds.), DIMACS Series in Discrete Mathematics and Theoretical Comp. Sci. Vol. 16, 1994, 117-146.

80. R.E. Burkard, K. Dlaska and H. Kellerer,
    The Quickest Disjoint Flow Problem, Central European Journal for Operations Research and Economics 3, 1994-95, 325-337.

81. R.E. Burkard, B. Fruhwirth and G. Rote,
    Vehicle routing in an automated warehouse: Analysis and optimization, Annals of Operations Research 57, 1995, 29-44.

82. R.E. Burkard,
    On the Role of Bottleneck Monge Matrices in Combinatorial Optimization, Operations Research Letters 17, 1995, 53-56.

83. R.E. Burkard and U. Pferschy,
    The Inverse-Parametric Knapsack Problem, European Journal of Operational Research 83, 1995, 376-393.

84. R.E. Burkard and E. Çela,
    Heuristics for Biquadratic Assignment Problems and their Computational Comparison, European Journal of Operational Research 83, 1995, 283-300.

85. R.E. Burkard and V. G. Deineko,
    Polynomially Solvable Cases of the Traveling Salesman Problem and a New Exponential Neighbourhood, Computing 54, 1995, 191-211.

86. R.E. Burkard, H. Leitner, R. Rudolf, Th. Siegl and E. Tabbert,
    Discrete Optimization Models for Treatment Planning in Radiation Therapy. In Science and Technology for Medicine: Biomedical Engineering in Graz (H. Hutten, ed.), Lengerich: Papst, 1995, 237-249.

87. R.E. Burkard, E. Çela and G.J. Woeginger,
    A Minimax Assignment Problem in Treelike Communication Networks, EJOR 87, 1995, 670-684.
    

88. R.E. Burkard, T. Dudás, and Th. Maier,
    Cut and Patch Steiner Trees for Ladders, Discrete Mathematics 161, 1996, 53-61.

89. R.E. Burkard, R. Rudolf and G.J. Woeginger,
    Three Dimensional Axial Assignment Problems with Decomposable Cost Coefficients, Discrete Applied Mathematics 65, 1996, 123-139.

90. R.E. Burkard, B. Klinz and R. Rudolf,
    Perspectives of Monge Properties in Optimization, Discrete Applied Mathematics 70, 1996, 95-161.

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

92. R.E. Burkard, V.M. Demidenko and R. Rudolf,
    An extension of Supnick and Kalmanson conditions with applications to the symmetric and asymmetric TSP, Izv. Akad. Nauk. Belarus, Ser. fiz.-math. nauk 3, 1996, 69-74 (in Russian).

93. R.E. Burkard, S. Karisch and F. Rendl,
    QAPLIB -- A quadratic assignment problem library. Update 1996, Journal of Global Optimization 10, 1997, 391-403.

94. R.E. Burkard, Q.F. Yang, E. Çela and G.J. Woeginger,
    Hamiltonian cycles in circulent graphs with two stripes, Discrete Mathematics 176, 1997, 233-254.

95. R.E. Burkard and G. Zhang,
    Bounded Space On-Line Variable-Sized Bin Packing, Acta Cybernetica 13, 1997, 63-76.

96. R.E. Burkard, U. Pferschy and R. Rudolf,
    On-line Waste Management in a Galvanization Plant, Yugoslav Journal of Operations Research 7, 1997, 1-13.
    

97. R.E. Burkard, E. Çela and T. Dudás,
    A Communication Assignment Problem on Trees: Heuristics and Asymptotic Behavior, in Network Optimization (P.M. Pardalos, D.W. Hearn and W.W. Hager, eds.), Lecture Notes in Economics and Mathematical Systems, Vol. 450, 127-155, Berlin: Springer, 1997.

98. R.E. Burkard and E. Çela,
    Quadratic and Three-Dimensional Assignments: An Annotated Bibliography. In Annotated Bibliographies in Combinatorial Optimization (M. Dell'Amico, F. Maffioli and S. Martello, eds.), J. Wiley, 1997, 373-391.

99. R.E. Burkard,
    Efficiently Solvable Special Cases of Hard Combinatorial Optimization Problems, Mathematical Programming 79, 1997, 55-69.

100. R.E. Burkard, V.M. Demidenko and R. Rudolf,
     A General Approach for Identifying Special Cases of the Travelling Salesman Problem with a Fixed Optimal Tour, Chinese Transactions of Operations Research 1, 1997, 41-53.

101. R.E. Burkard, E. Çela, G. Rote and G.J. Woeginger,
     The Quadratic Assignment Problem with a Monotone Anti-Monge Matrix and a Symmetric Toeplitz Matrix: Easy and Hard Cases, Mathematical Programming 82, 1998, 125-158.
     

102. R.E. Burkard, E. Çela, V.M. Demidenko, N.N. Metelski and G.J. Woeginger,
     A Unified Approach to Simple Special Cases of Extremal Permutation, Optimization 44, 1998, 123-138.

103. R.E. Burkard, V.G. Deineko, R. van Dal, J. van der Veen and G. J. Woeginger,
     Well-Solvable Special Cases of the TSP: A Survey, SIAM Review 40, 1998, 496-546.

104. R.E. Burkard, V.G. Deineko and G. J. Woeginger,
     The Travelling Salesman and the PQ-Tree, Mathematics of Operations Research 23, 1998, 613-623.
     

105. R.E. Burkard and J. Krarup,
     A Linear Algorithm for the Pos/Neg-Weighted 1-Median Problem on a Cactus, Computing 60, 1998, 193-215.

106. R.E. Burkard and V. G. Deineko,
     On the Traveling Salesman Problem with a Relaxed Monge Matrix, Information Processing Letters 67, 1998, 231-237.

107. R.E. Burkard and Y. He,
     A note on multifit scheduling for uniform machines, Computing 61, 1998, 277-283.

108. R.E. Burkard, Y. He and H. Kellerer,
     A linear compound algorithm for uniform machine scheduling, Computing 61, 1998, 1-9.

109. R.E. Burkard, M. Kocher and R. Rudolf,
     Rounding Strategies for Mixed integer programs arising from chemical production planning, Yugoslav Journal of Operations Research 8, 1998, 9-23.

110. R.E. Burkard,
     Communication Network Assignment Problem (CAP). In: Encyclopedia of Optimization (Chris Floudas and P.M. Pardalos, eds.), Dordrecht: Kluwer, 1998, pp. 268-270. Second edition Springer, Heidelberg, 2008, pp. 394-396.

111. R.E. Burkard, M. Hujter, B. Klinz, R. Rudolf and M. Wennink,
     A process scheduling problem arising from chemical production planning. Optimization Methods and Software 10, 1998, 175-196.

112. R.E. Burkard,
     Assignment Problems, Proceedings of the XV. IFIP World Computer Conference, 31. August - 4. September 1998 Wien-Budapest, Series Fundamentals - Foundations of Computer Science (K. Mehlhorn, ed.), 49-61.

113. R.E. Burkard, E. Çela, P.M. Pardalos and L.S. Pitsoulis,
     The Quadratic Assignment Problem. In Handbook of Combinatorial Optimization (D.-Z. Du and P.M. Pardalos, eds.), Volume 3, Kluwer Academic Publishers, 1998, pp. 241-337.

114. R.E. Burkard and Z. Tan,
     The simple block iterative algorithm of an extended entropy model and its convergence, Acta Math. Appl. Sinica (English Series) 14, 1998, 96-105.

115. R.E. Burkard, V. G. Deineko and G.J. Woeginger,
     The Travelling Salesman Problem on Permuted Monge Matrices. Journal of Combinatorial Optimization 2, 1999, 333-350.

116. R.E. Burkard, K. Feldbacher, B. Klinz and G.J. Woeginger,
     Minimum Cost Strong Network Orientation Problems: Classification, Complexity and Algorithms. Networks 33, 1999, 57-70.

117. R.E. Burkard,
     OR Utopia. European Journal of Operational Research 119, 1999, 224-234.

118. R.E. Burkard and E. Çela,
     Linear Assignment Problems and Extensions. In Handbook of Combinatorial Optimization (D.-Z. Du and P.M. Pardalos, eds.), Supplement Volume A, Kluwer Academic Publishers, 1999, 75-149.

119. St. Meusel and R.E. Burkard,
     A transportation problem with a permuted demand vector. Mathematical Methods of Operations Research (ZOR) 50 , 1999, 1-8.

120. R.E. Burkard and M. M. Miatselski,
     Volume maximization and orthoconvex approximation of orthogons, Computing 63, 1999, 317-330.

121. R.E. Burkard, E. Çela and H. Dollani,
     2-Medians in networks with pos/neg weights. Discrete Applied Mathematics 105, 2000, 51-71.

122. R.E. Burkard and E. Çela,
     Optimal location of facilities for a two stage production process. ECMI Newsletter 28, October 2000, pp. 14-16.

123. R.E. Burkard,
     Location problems: from classical geometry to managerial decisions. European Journal of Operations Research 8, 2000, 3-11.

124. R.E. Burkard,
     Zuordnungsprobleme: Ein Streifzug durch die kombinatorische Optimierung. in: Zur Kunst des formalen Denkens, R.E. Burkard, W. Maass and P. Weibel (eds.), Passagen Verlag, Wien, 2000, pp. 193-207, (in German).

125. R.E. Burkard, B. Klinz and J. Zhang,
     Bottleneck capacity expansion problems with general budget constraints. RAIRO Operations Research 35, 2001, 1-20.

126. R.E. Burkard, H. Dollani and P.T. Thach,
     Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave network flow problem in acyclic networks. Journal of Global Optimization 19, 2001, 121-139.

127. R.E. Burkard,
     Trees and paths: graph optimisation problems with industrial applications. In: Computational Mathematics driven by Industrial Applications, Springer Lecture Notes in Mathematics 1739, 2001, pp. 1-38.

128. R.E. Burkard, H. Dollani, Y. Lin and G. Rote,
     The obnoxious center problem on a tree. SIAM Journal on Discrete Mathematics 14, 2001, 498-509.

129. R.E. Burkard and H. Dollani,
     Robust location problems with pos/neg weights on a tree, Networks 38, 2001, 102-113.

130. R.E. Burkard,
     Transportation Problems. in: Models, Methods and Decision Support for Management (Essays in Honor of Paul Stähly), P. Kischka, U. Leopold-Wildburger, R.H. Möhring and F.J. Radermacher (eds.), Physica-Verlag, Heidelberg, New York, 2001, pp. 249-261.

131. R.E. Burkard,
     Transportation Problems. GOR News 13, November 2001, 25-32.

132. R.E. Burkard,
     The Travelling Salesman Problem. Handbook of Applied Optimization (P.M. Pardalos and M.G.C. Resende eds.), Oxford University Press, 2001.

133. R.E. Burkard,
     Selected topics in assignment problems. Discrete Applied Mathematics 123, 2002, 257-302.

134. R.E. Burkard, T. Fortuna and C.A.J. Hurkens,
     Makespan minimization for chemical batch processes using non-uniform time-grids. Computers and Chemical Engineering 26, 2002, 1321-1332.

135. R.E. Burkard and H. Dollani,
     A note on the robust 1-center problem on trees. Annals of Operations Research 110, 2002, 69-82.

136. R.E. Burkard and H. Dollani,
     Center problems with pos/neg weights on trees. European Journal of Operational Research 145, 2003, 483-495.

137. R.E. Burkard and P. Butkovic,
     Max-algebra and the linear assignment problem. Mathematical Programming 98, 2003, 415-429.

138. R.E. Burkard and P. Butkovic,
     Finding all essential terms of a characteristic maxpolynomial. Discrete Applied Mathematics 130, 2003, 367-380.

139. R.E. Burkard and G. Chen,
     Constrained Steiner trees in Halin graphs. RAIRO Operations Research 37, 2003, 179-194.

140. R.E. Burkard, C.Pleschiutschnig and J. Zhang,
     Inverse p-median problems. Discrete Optimization 1, 2004, 23-39.

141. R.E. Burkard and V.G. Deineko,
     On the Euclidean TSP with a permuted van der Veen matrix. Information Processing Letters 91, 2004, 259-262.

142. R.E. Burkard, Y. Lin and Z. Zhang,
     Weight reduction problems with certain bottleneck objectives. European Journal of Operational Research 153, 2004, 191-199.

143. R.E. Burkard,
     (Generalized) convexity and discrete optimization. In: Generalized convexity, generalized monotonicity and applications, (eds. A. Eberhard, N. Hadjisavvas and D.T. Luc), Nonconvex Optim. Appl., Vol 77, Springer, New York, 2005, pp. 23-37.

144. H. Albrecher, R.E. Burkard and E. Çela,
     An asmptotical study of combinatorial optimization by means of statistical mechanics. Journal of Computational and Applied Mathematics 186, 2006, 148-162.

145. R.E. Burkard and C. Zelle,
     The reel and sheet cutting problem in paper industry. Central European Journal of Operations Research 13, 2005, 147-167.

146. R.E. Burkard and J. Hatzl,
     Review, extensions and computational comparison of MILP formulations for scheduling of batch processes. Computers and Chemical Engineering 29, 2005, 1752-1769.

147. R.E. Burkard and J. Hatzl,
     A complex time based construction heuristic for batch scheduling problems in the chemical industry. European J. Operational Research 174, 2006, 1162-1183.

148. R.E. Burkard,
     Monge properties, discrete convexity and applications. European J. Operational Research 176, 2007, 1-14.

149. R.E. Burkard, E. Gassner and J. Hatzl,
     A linear time algorithm for the reverse 1-median problem on a cycle. Networks 48, 2006, 16-23.

150. R.E. Burkard,
     Discrete optimization: an Austrian view. Annals of Operations Research 149, 2007, 43-48.

151. J. Fathali, H. Taghizadeh Kakhki and R.E. Burkard,
     An anty colony algorithm for the pos/neg weighted p-median problem. Central European Journal of Operations Research 14, 2006, 229-246.

152. R.E. Burkard, J. Fathali and H. Taghizadeh Kakhki,
     The p-maxian problem on a tree. Operations Research Letters 35
153. R.E. Burkard and J. Hatzl,
     Modelling and optimizing batch processes in the chemical industry. In: Math Everywhere, ed. by G. Aletti, M. Burger, A. Micheletti and D. Morale, Springer, Berlin, 2007, pp. 279-290.

154. G. Chen, G. Zhang and R.E. Burkard,
     The web proxy location problem in general tree of ring networks. Mathematical Methods of Operations Research 65, 2007, 229-238.

155. R.E. Burkard and J. Fathali,
     A polynomial method for the pos/neg weighted 3-median problem on a tree. Mathematical Methods of Operations Research 65, 2007, 229-238.

156. R.E. Burkard,
     Admissible transformations and assignment problems. Vietnam Journal of Mathematics 35, 2007, 373-386.

157. R.E. Burkard, C. Pleschiutschnig and J. Zhang,
     The inverse 1-median problem on a cycle. Journal of Discrete Optimization 5, 2008, 242-253.

158. R.E. Burkard, E. Gassner and J. Hatzl,
     Reverse 2-median problem on trees. Discrete Applied Mathematics 156, 2008, 242-253.

159. R.E. Burkard,
     Communication Network Assignment Problem. In: Encyclopedia of Optimization, 2-nd edition (eds.: Ch. Floudas and P.M. Pardalos), Springer, Berlin-New York, 2009, pp. 394-396.

160. R.E. Burkard and J. Hatzl,
     Median problems with positive and negative weights on cycles and cacti. Journal of Combinatorial Optimization 20, 2010, 27-46.

161. B. Alizadeh, R.E. Burkard and U. Pferschy,
     Inverse 1-center location problems with edge length augmentation on trees. Computing 86, 2009, 331-343.

162. F. Baroughi-Bonab, R.E. Burkard and B. Alizadeh,
     Inverse median location problems with variable coordinates. Central European Journal of Operations Research 18, 2010, 365-381.

163. R.E. Burkard, M. Galavii and E. Gassner,
     The inverse Fermat-Weber problem. European Journal of Operational Research 206, 2010, 11-17.

164. R.E. Burkard and B. Alizadeh,
     Inverse center location problems. Electronic Notes in Discrete Optimization 36, 2010, 105-110.

165. R.E. Burkard and R. Rissner,
     Polynomially solvable special cases of the quadratic bottleneck assignment problem. Journal of Combinatorial Optimization 22, 2011, 845-856.

166. B. Alizadeh and R.E. Burkard,
     Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees. Networks 58, 2011, 190-200.

167. F. Baroughi, R.E. Burkard and E. Gassner,
     Inverse p-Median Problems with Variable Edge Lengths. Mathematical Methods of Operations Research 73, 2011, 263-280.

168. B. Alizadeh and R.E. Burkard,
     Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees. Discrete Applied Mathematics 159, 2011, 706-716.

169. B. Alizadeh and R.E. Burkard,
     A linear time algorithm for inverse obnoxious center location problems on networks. Central European Journal of Operations Research, 213, 2013, 585-594.

170. R. Rissner and R.E. Burkard
     Bounds on the radius and status of graphs. Networks 64, 2014, 76-83.

171. R.E. Burkard
     Quadratic Assignment Problems. in Handbook of Combinatorial Optimization, 2nd ed., ed. by P. Pardalos, D.Z. Du and R. Graham, Springer, New York, 2013, 2741-2814.

172. K. Zernig, C. Berg, R.E. Burkard, G. Kniely and P. Schwager
     Bemerkenswertes zur Flora der Steiermark 5. Joannea Botanik 14, 2017, 261-275, (in German).

173. K. Zernig, C. Berg, R.E. Burkard, P. Englmaier, G. Heber, M. Hohla, G. Kniely, G. Nowotny, M. Pöltl and I. Wendelin
     Bemerkenswertes zur Flora der Steiermark 6. Joannea Botanik 15, 2018, 215-245, (in German).

Extended Abstracts

1. R.E. Burkard,
   Convexity and discrete optimization. Extended Abstract, In: Operations Research 1991, (P. Gritzmann, R. hettich, R. Horst and E. Sachs, eds), Physica Verlag, Heidelberg, pp. 1-4.

2. R.E. Burkard, E. Çela, T. Dudás and G. J. Woeginger,
   Minimization of Noise in Tree-like Communication Structures. Extended Abstract, Proc. 17th Intern. Conference ITI'95, June 13-16, 1995, Pula, Croatia, 3-6.

3. R. E Burkard, E. Çela, G. Rote and G.J. Woeginger,
   The quadratic assignment problem with a monotone anti-Monge matrix and a symmetric Toeplitz matrix: Easy and hard cases. Extended abstract in "Integer Programming and Combinatorial Optimization" (W.H. Cunningham, S.T. McCormick and M. Queyranne, eds.), Lecture Notes in Computer Science Vol. 1084, 204-218, Berlin: Springer, 1996.

4. R.E. Burkard, V.G. Deineko and G. J. Woeginger,
   The Travelling Salesman and the PQ-Tree. Extended abstract in Integer Programming and Combinatorial Optimization (W.H. Cunningham, S.T. McCormick and M. Queyranne, eds.). Lecture Notes in Computer Science Vol. 1084, 490-504, Berlin: Springer, 1996.

5. R.E. Burkard, U. Pferschy and R. Rudolf,
   Extended abstract: Waste Treatment in a Metal-Processing Plant, in Operations Research Proceedings 1996 (M. Zimmermann, U. Derigs, W. Gaul, R.H. Möhring, K.-P. Schuster, eds.), 392-397, Springer, Berlin: 1997.
   

6. R.E. Burkard, U. Pferschy and R. Rudolf,
   Extended abstract: Waste Water Minimization in Metal Ind ustry, in Proceedings of the 4th International Symposium on Operational Research (V. Rupnik, L. Zadnik Stirn and S. Drobne, eds.), 77-82, Preddvor, Slovenia, October 1-3, 1997 Ljubljana: Slovenian Soc. Informatika.

7. R.E. Burkard and T. Fortuna,
   Batch processing in the chemical industry: A model based on a nonuniform time discretization. In Proceedings of the 5-th International Symposium on Operational Research, (V. Rupnik, L. Zadnik-Stirn and S. Drobe, eds), Preddvor, Slovenia, September 30-October 2, 1999, 1-6.

8. R.E. Burkard, B. Klinz, Y. Lin and J. Zhang,
   Capacity expansion and weight reduction problems. Extended abstract in Proceedings of the 6th International Symposium on Operational Research, V. Rupnick, L. Zadnick-Stirn and S. Drobne (eds.), Predddvor (Slovenia), Sept. 26-28, 2001, Slovenian Society Informatika, Section of Operational Research, Ljubljana 2001, pp. 119-124.

9. R.E. Burkard and J. Hatzl,
   Mixed-integer linear programs for batch processes. Extended abstract in Discrete Optimization Methods in Production and Logistics (DOM'2004), Proceedings of the 2nd International Workshop Omsk-Irkutsk, 20-27 July 2004, ed. by A.V. Eremeev, 108-113.

10. R.E. Burkard, M. Galavii and E. Gassner,
    Inverse 1-median problems. Oberwolfach Reports 5, 2008.

Back to Publications