Rainer E. Burkard

Personal Home Page

http://www.opt.math.tu-graz.ac.at/burkard/

Articles in Scholarly Journals [Incomplete List]

  1. The inverse 1-median problem on a cycle☆
    Discrete Optimization, vol. 5, no. 2, pp. 242–253, 2008
  2. Monge properties, discrete convexity and applications☆
    European Journal of Operational Research, vol. 176, no. 1, pp. 1–14, 2007
  3. The pp-maxian problem on a tree
    Operations Research Letters, vol. 35, no. 3, pp. 331–335, 2007
  4. A polynomial method for the pos/neg weighted 3-median problem on a tree
    Mathematical Methods of Operations Research, vol. 65, no. 2, pp. 229–238, 2007
  5. Discrete optimization: An Austrian view
    Annals of Operations Research, vol. 149, no. 1, pp. 43–48, 2007
  6. The web proxy location problem in general tree of rings networks
    Journal of Combinatorial Optimization, vol. 12, no. 4, pp. 327–336, 2006
  7. An ant colony algorithm for the pos/neg weighted p-median problem
    Central European Journal of Operations Research, vol. 14, no. 3, pp. 229–246, 2006
  8. A linear time algorithm for the reverse 1-median problem on a cycle
    Networks, vol. 48, no. 1, pp. 16–23, 2006
  9. A complex time based construction heuristic for batch scheduling problems in the chemical industry☆
    European Journal of Operational Research, vol. 174, no. 2, pp. 1162–1183, 2006
  10. An asymptotical study of combinatorial optimization problems by means of statistical mechanics
    Journal of Computational and Applied Mathematics, vol. 186, no. 1, pp. 148–162, 2006
  11. Review, extensions and computational comparison of MILP formulations for scheduling of batch processes
    Computers & Chemical Engineering, vol. 29, no. 8, pp. 1752–1769, 2005
  12. Inverse median problems*1
    Discrete Optimization, vol. 1, no. 1, pp. 23–39, 2004
  13. On the Euclidean TSP with a permuted Van der Veen matrix*1
    Information Processing Letters, vol. 91, no. 6, pp. 259–262, 2004
  14. Weight reduction problems with certain bottleneck objectives
    European Journal of Operational Research, vol. 153, no. 1, pp. 191–199, 2004
  15. Finding all essential terms of a characteristic maxpolynomial
    Discrete Applied Mathematics, vol. 130, no. 3, pp. 367–380, 2003
  16. Center problems with pos/neg weights on trees
    European Journal of Operational Research, vol. 145, no. 3, pp. 483–495, 2003
  17. Annals of Operations Research, vol. 110, no. 1/4, pp. 69–82, 2002
  18. Makespan minimization for chemical batch processes using non-uniform time grids
    Computers & Chemical Engineering, vol. 26, no. 9, pp. 1321–1332, 2002
  19. Bottleneck Capacity Expansion Problems with General Budget Constraints
    Operations Research, vol. 35, no. 1, pp. 1–20, 2001
  20. Journal of Global Optimization, vol. 19, no. 2, pp. 121–139, 2001
  21. The Obnoxious Center Problem on a Tree
    SIAM Journal on Discrete Mathematics, vol. 14, no. 4, p. 498, 2001
  22. Robust location problems with pos/neg weights on a tree
    Networks, vol. 38, no. 2, pp. 102–113, 2001
  23. 2-Medians in trees with pos/neg weights
    Discrete Applied Mathematics, vol. 105, no. 1-3, pp. 51–71, 2000
  24. OR Utopia
    European Journal of Operational Research, vol. 119, no. 2, pp. 224–234, 1999
  25. Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
    Networks, vol. 33, no. 1, pp. 57–70, 1999
  26. Volume Maximization and Orthoconvex Approximation of Orthogons
    Computing, vol. 63, no. 4, pp. 317–330, 1999
  27. The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
    Mathematical Programming, vol. 82, no. 1-2, pp. 125–158, 1998
  28. A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
    Computing, vol. 60, no. 3, pp. 193–215, 1998
  29. A note on MULTIFIT scheduling for uniform machines
    Computing, vol. 61, no. 3, pp. 277–283, 1998
  30. A linear compound algorithm for uniform machine scheduling
    Computing, vol. 61, no. 1, pp. 1–9, 1998
  31. A unified approach to simple special cases of extremal permutation problems
    Optimization, vol. 44, no. 2, pp. 123–138, 1998
  32. A process scheduling problem arising from chemical production planning
    Optimization Methods and Software, vol. 10, no. 2, pp. 175–196, 1998
  33. Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
    SIAM Review, vol. 40, no. 3, p. 496, 1998
  34. Journal of Combinatorial Optimization, vol. 2, no. 4, pp. 333–350, 1998
  35. On the traveling salesman problem with a relaxed Monge matrix
    Information Processing Letters, vol. 67, no. 5, pp. 231–237, 1998
  36. Journal of Global Optimization, vol. 10, no. 4, pp. 391–403, 1997
  37. Hamiltonian cycles in circulant digraphs with two stripes
    Discrete Mathematics, vol. 176, no. 1-3, pp. 233–254, 1997
  38. Efficiently solvable special cases of hard combinatorial optimization problems
    Mathematical Programming, vol. 79, no. 1-3, pp. 55–69, 1997
  39. Cut and patch Steiner trees for ladders
    Discrete Mathematics, vol. 161, no. 1-3, pp. 53–61, 1996
  40. Three-dimensional axial assignment problems with decomposable cost coefficients
    Discrete Applied Mathematics, vol. 65, no. 1-3, pp. 123–139, 1996
  41. Perspectives of Monge properties in optimization
    Discrete Applied Mathematics, vol. 70, no. 2, pp. 95–161, 1996
  42. Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood
    Computing, vol. 54, no. 3, pp. 191–211, 1995
  43. Vehicle routing in an automated warehouse: Analysis and optimization
    Annals of Operations Research, vol. 57, no. 1, pp. 29–44, 1995
  44. A minimax assignment problem in treelike communication networks
    European Journal of Operational Research, vol. 87, no. 3, pp. 670–684, 1995
  45. Vehicle scheduling in two-cycle flexible manufacturing systems
    Mathematical and Computer Modelling, vol. 20, no. 2, pp. 19–31, 1994
  46. The quickest flow problem
    ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research, vol. 37, no. 1, pp. 31–58, 1993
  47. Constrained partitioning problems Discrete Applied Mathematics 28 (1990) 21–34
    Discrete Applied Mathematics, vol. 46, no. 2, p. 185, 1993
  48. Lexicographic bottleneck problems
    Operations Research Letters, vol. 10, no. 5, pp. 303–308, 1991
  49. Reshipments and overshipments in transportation problems with minimax objective
    OR Spektrum, vol. 13, no. 3, pp. 133–140, 1991
  50. Mathematical programs with a two-dimensional reverse convex constraint
    Journal of Global Optimization, vol. 1, no. 2, pp. 145–154, 1991
  51. Shortest polygonal paths in space
    Computing, vol. 45, no. 1, pp. 51–68, 1990
  52. Constrained partitioning problems
    Discrete Applied Mathematics, vol. 28, no. 1, pp. 21–34, 1990
  53. Cyclic schedules for r irregularly occurring events
    Journal of Computational and Applied Mathematics, vol. 30, no. 2, pp. 173–189, 1990
  54. Optimal schedules for periodically recurring events
    Discrete Applied Mathematics, vol. 15, no. 2-3, pp. 167–180, 1986
  55. Probabilistic asymptotic properties of some combinatorial optimization problems
    Discrete Applied Mathematics, vol. 12, no. 1, pp. 21–29, 1985
  56. Time-slot assignment for TDMA-systems
    Computing, vol. 35, no. 2, pp. 99–112, 1985
  57. Eigenfunctions and optimal orbits
    Journal of Computational and Applied Mathematics, vol. 11, no. 1, pp. 83–94, 1984
  58. Quadratic assignment problems
    European Journal of Operational Research, vol. 15, no. 3, pp. 283–289, 1984
  59. A thermodynamically motivated simulation procedure for combinatorial optimization problems
    European Journal of Operational Research, vol. 17, no. 2, pp. 169–174, 1984
  60. A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
    European Journal of Operational Research, vol. 13, no. 4, pp. 374–386, 1983
  61. The asymptotic probabilistic behaviour of quadratic sum assignment problems
    Zeitschrift für Operations Research, vol. 27, no. 1, pp. 73–81, 1983
  62. On abstract duality in mathematical programming
    Zeitschrift für Operations Research, vol. 26, no. 1, pp. 197–209, 1982
  63. On random quadratic bottleneck assignment problems
    Mathematical Programming, vol. 23, no. 1, pp. 227–232, 1982
  64. Efficiency and Optimality in Minisum, Minimax 0-1 Programming Problems
    The Journal of the Operational Research Society, vol. 33, no. 2, p. 137, 1982
  65. A Relationship between optimality and efficiency in multicriteria 0–1 programming problems
    Computers & Operations Research, vol. 8, no. 4, pp. 241–247, 1981