The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Rainer E. Burkard: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Rainer E. Burkard
    Assignment Problems. [Citation Graph (0, 0)][DBLP]
    IFIP Congress: Fundamentals - Foundations of Computer Science, 1998, pp:49-62 [Conf]
  2. Rainer E. Burkard, Eranda Çela, Günter Rote, Gerhard J. Woeginger
    The Quadratic Assignment Problem with a Monotone Anti-Monge and a Symmetric Toeplitz Matrix: Easy and Hard Cases. [Citation Graph (0, 0)][DBLP]
    IPCO, 1996, pp:204-218 [Conf]
  3. Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger
    The Travelling Salesman and the PQ-Tree. [Citation Graph (0, 0)][DBLP]
    IPCO, 1996, pp:490-504 [Conf]
  4. Rainer E. Burkard, Tibor Dudás
    Steiner Minimum Trees for Equidistant Points on Two Sides of an Angle. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1996, v:12, n:3, pp:313-324 [Journal]
  5. Rainer E. Burkard, Guochuan Zhang
    Bounded Space On-Line Variable-Sized Bin Packing. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1997, v:13, n:1, pp:63-76 [Journal]
  6. Rainer E. Burkard, Vladimir G. Deineko
    Polynomially Solvable Cases of the Traveling Salesman Problem and a New Exponential Neighborhood. [Citation Graph (0, 0)][DBLP]
    Computing, 1995, v:54, n:3, pp:191-212 [Journal]
  7. Rainer E. Burkard, Y. He
    A Note on MULTIFIT Scheduling for Uniform Machines. [Citation Graph (0, 0)][DBLP]
    Computing, 1998, v:61, n:3, pp:277-283 [Journal]
  8. Rainer E. Burkard, Y. He, Hans Kellerer
    A Linear Compound Algorithm for Uniform Machine Scheduling. [Citation Graph (0, 0)][DBLP]
    Computing, 1998, v:61, n:1, pp:1-10 [Journal]
  9. Rainer E. Burkard, Jakob Krarup
    A Linear Algorithm for the Pos/Neg-Weighted 1-Median Problem on a Cactus. [Citation Graph (0, 0)][DBLP]
    Computing, 1998, v:60, n:3, pp:193-216 [Journal]
  10. Rainer E. Burkard, M. M. Miatselski
    Volume Maximization and Orthoconvex Approximation of Orthogons. [Citation Graph (0, 0)][DBLP]
    Computing, 1999, v:63, n:4, pp:317-330 [Journal]
  11. Rainer E. Burkard, Hans Keiding, Peter M. Pruzan, Jakob Krarup
    A Relationship between optimality and efficiency in multicriteria 0-1 programming problems. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1981, v:8, n:4, pp:241-247 [Journal]
  12. Rainer E. Burkard
    Selected topics on assignment problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:123, n:1-3, pp:257-302 [Journal]
  13. Rainer E. Burkard, Peter Butkovic
    Finding all essential terms of a characteristic maxpolynomial. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:130, n:3, pp:367-380 [Journal]
  14. Rainer E. Burkard, Eranda Çela, Helidon Dollani
    2-Medians in trees with pos/neg weights. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:105, n:1-3, pp:51-71 [Journal]
  15. Rainer E. Burkard, Bettina Klinz, Rüdiger Rudolf
    Perspectives of Monge Properties in Optimization. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:70, n:2, pp:95-161 [Journal]
  16. Rainer E. Burkard, Rüdiger Rudolf, Gerhard J. Woeginger
    Three-dimensional Axial Assignment Problems with Decomposable Cost Coefficients. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:65, n:1-3, pp:123-139 [Journal]
  17. Rainer E. Burkard, En-Yu Yao
    Erratum: Constrained Partitioning Problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:46, n:2, pp:185- [Journal]
  18. Rainer E. Burkard, Vladimir G. Deineko
    On the Euclidean TSP with a permuted Van der Veen matrix. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:91, n:6, pp:259-262 [Journal]
  19. Rainer E. Burkard, Vladimir G. Deineko
    On the Traveling Salesman Problem with a Relaxed Monge Matrix. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:67, n:5, pp:231-237 [Journal]
  20. Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger
    The Travelling Salesman Problem on Permuted Monge Matrices. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1998, v:2, n:4, pp:333-350 [Journal]
  21. Guangting Chen, Gu Zhang, Rainer E. Burkard
    The web proxy location problem in general tree of rings networks. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2006, v:12, n:4, pp:327-336 [Journal]
  22. Rainer E. Burkard, Peter L. Hammer
    A note on Hamiltonian split graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:28, n:2, pp:245-248 [Journal]
  23. Rainer E. Burkard
    Efficiently solvable special cases of hard combinatorial optimization problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1997, v:79, n:, pp:55-69 [Journal]
  24. Rainer E. Burkard, Eranda Çela, Günter Rote, Gerhard J. Woeginger
    The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:125-158 [Journal]
  25. Rainer E. Burkard, Helidon Dollani
    Robust location problems with pos/neg weights on a tree. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:38, n:2, pp:102-113 [Journal]
  26. Rainer E. Burkard, Karin Feldbacher, Bettina Klinz, Gerhard J. Woeginger
    Minimum-cost strong network orientation problems: Classification, complexity, and algorithms. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:33, n:1, pp:57-70 [Journal]
  27. Rainer E. Burkard, Elisabeth Gassner, Johannes Hatzl
    A linear time algorithm for the reverse 1-median problem on a cycle. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:48, n:1, pp:16-23 [Journal]
  28. Rainer E. Burkard, Helidon Dollani, Yixun Lin, Günter Rote
    The Obnoxious Center Problem on a Tree. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:4, pp:498-509 [Journal]
  29. Rainer E. Burkard, Johannes Hatzl
    A complex time based construction heuristic for batch scheduling problems in the chemical industry. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2006, v:174, n:2, pp:1162-1183 [Journal]
  30. Rainer E. Burkard
    Monge properties, discrete convexity and applications. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:176, n:1, pp:1-14 [Journal]
  31. Rainer E. Burkard, Yixun Lin, Jianzhong Zhang
    Weight reduction problems with certain bottleneck objectives. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2004, v:153, n:1, pp:191-199 [Journal]
  32. Rainer E. Burkard, Helidon Dollani
    Center problems with pos/neg weights on trees. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2003, v:145, n:3, pp:483-495 [Journal]
  33. Reinhardt Euler, Rainer E. Burkard, R. Grommes
    On latin squares and the facial structure of related polytopes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:62, n:2, pp:155-181 [Journal]
  34. Qi Fan Yang, Rainer E. Burkard, Eranda Çela, Gerhard J. Woeginger
    Hamiltonian cycles in circulant digraphs with two stripes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:176, n:1-3, pp:233-254 [Journal]
  35. Rainer E. Burkard, Tibor Dudás, Thomas Maier
    Cut and patch Steiner trees for ladders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:161, n:1-3, pp:53-61 [Journal]

  36. Algorithmus 25 Verfahren zur gemischt-ganzzahligen, konvexen Optimierung. [Citation Graph (, )][DBLP]


  37. Inverse 1-center location problems with edge length augmentation on trees. [Citation Graph (, )][DBLP]


  38. Reverse 2-median problem on trees. [Citation Graph (, )][DBLP]


  39. Efficiently solvable special cases of bottleneck travelling salesman problems. [Citation Graph (, )][DBLP]


  40. Constrained partitioning problems. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002