Discrete Optimization

Research output

Research output per year 1989 1998 1999 2006

• 49 Article
• 4 Chapter
• 1 Diploma Thesis
• 1 Doctoral Thesis
• 1 More
  • 1 Habilitation

Research output per year

Research output per year

Search results

• 2006

  An asymptotical study of combinatorial optimization problems by means of statistical mechanics

  Albrecher, H., Burkard, R. E. & Dragoti-Cela, E., 2006, In: Journal of Computational and Applied Mathematics. 186, 1, p. 148-162

  Research output: Contribution to journal › Article › peer-review
• 2005

  A note on the asymptotic behaviour of bottleneck problems

  Albrecher, H., 2005, In: Operations Research Letters. 33, 2, p. 183-186

  Research output: Contribution to journal › Article › peer-review
• 2004

  Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results

  Heuberger, C., 2004, In: Journal of Combinatorial Optimization . 8, p. 329-361

  Research output: Contribution to journal › Article › peer-review

• Minimum cost dynamic flow problems: The series-parallel case

  Klinz, B. & Wöginger, G. J., 2004, In: Networks. 43, p. 153-162

  Research output: Contribution to journal › Article › peer-review

• Weight reduction problems with certain bottleneck objectives

  Burkard, R. E., Lin, Y. & Zhang, Z., 2004, In: European Journal of Operational Research. 153, p. 191-199

  Research output: Contribution to journal › Article › peer-review
• 2003

  Center Problems with pos/neg weights on trees

  Burkard, R. E. & Dollani, H., 2003, In: European Journal of Operational Research. 145, p. 483-495

  Research output: Contribution to journal › Article › peer-review

• Computation of ideal and Nadir values and implications for their use in MCDM methods

  Ehrgott, M. & Tenfelde-Podehl, D., 2003, In: European Journal of Operational Research. 151, p. 119-139

  Research output: Contribution to journal › Article › peer-review

• Constrained Steiner trees in Halin graphs

  Chen, G. & Burkard, R. E., 2003, In: RAIRO / Operations research. 37, p. 179-194

  Research output: Contribution to journal › Article › peer-review

• Finding all essential terms of characteristic maxpolynomial

  Burkard, R. E. & Butkovic, P., 2003, In: Discrete Applied Mathematics. 130, p. 367-380

  Research output: Contribution to journal › Article › peer-review

• Max-algebra and the linear assignment problem

  Burkard, R. E. & Butkovic, P., 2003, In: Mathematical Programming. 98, p. 415-429

  Research output: Contribution to journal › Article › peer-review

• Which cost matrices are immune against the transportation paradox?

  Deineko, V., Klinz, B. & Wöginger, G. J., 2003, In: Discrete Applied Mathematics. 130, p. 495-501

  Research output: Contribution to journal › Article › peer-review
• 2002

  A note on the robust 1-center problem on trees

  Burkard, R. E. & Dollani, H., 2002, In: Annals of Operations Research. 110, p. 68-82

  Research output: Contribution to journal › Article › peer-review

• Makespan minimization of chemical batch processes using non-uniform time-grids

  Burkard, R. E., Fortuna, T. & Hurkens, C. A. J., 2002, In: Computers & Chemical Engineering. 26, p. 1321-1332

  Research output: Contribution to journal › Article › peer-review

• Selected topics in assignment problems

  Burkard, R. E., 2002, In: Discrete Applied Mathematics. 123, p. 257-302

  Research output: Contribution to journal › Article › peer-review

• The travelling salesman problem

  Burkard, R. E., 2002, Handbook of Applied Optimization. Oxford: Oxford University Press, p. 616-624

  Research output: Chapter in Book/Report/Conference proceeding › Chapter
• 2001

  Bottleneck capacity expansion problems with general budget constraints

  Burkard, R. E., Klinz, B. & Zhang, J., 2001, In: RAIRO / Operations research. 35, p. 1-20

  Research output: Contribution to journal › Article › peer-review

• Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave network flow problem in acyclic networks

  Burkard, R. E., Dollani, H. & Thach, P. T., 2001, In: Journal of global optimization. 19, p. 121-139

  Research output: Contribution to journal › Article › peer-review

• Robust problems with pos/neg weights on a tree

  Burkard, R. E. & Dollani, H., 2001, In: Networks. 38, p. 102-113

  Research output: Contribution to journal › Article › peer-review

• The obnoxious center problem on a tree

  Burkard, R. E., Dollani, H., Lin, Y. & Rothe, G., 2001, In: SIAM Journal on Discrete Mathematics. 14, p. 498-509

  Research output: Contribution to journal › Article › peer-review
• 2000

  2-Medians in networks with pos/neg weights

  Burkard, R. E., Dragoti-Cela, E. & Dollani, H., 2000, In: Discrete Applied Mathematics. 105, p. 51-71

  Research output: Contribution to journal › Article › peer-review

• Optimal location of facilities for a two stage production process

  Burkard, R. E. & Dragoti-Cela, E., 2000, In: ECMI newsletter. 28, p. 14-16

  Research output: Contribution to journal › Article
• 1999

  A note on the bottleneck graph partition problem

  Klinz, B. & Wöginger, G. J., 1999, In: Networks. 33, 3, p. 189-191

  Research output: Contribution to journal › Article › peer-review

• A note on the complexity of the transportation problem with a permutable demand vector

  Hujter, M., Klinz, B. & Wöginger, G. J., 1999, In: Mathematical Methods of Operations Research. 50, p. 9-16

  Research output: Contribution to journal › Article › peer-review

• A transportation problem with a permuted demand vector

  Meusel, S. & Burkard, R. E., 1999, In: Mathematical Methods of Operations Research. 50, p. 1-8

  Research output: Contribution to journal › Article › peer-review

• Minimal expansions in redundant number systems and shortest paths in graphs

  Heuberger, C., 1999, In: Computing. 63, p. 341-349

  Research output: Contribution to journal › Article › peer-review

• Minimum cost strong network orientation problems: Classification, algorithms and complexity

  Burkard, R. E., Feldbacher, K., Klinz, B. & Wöginger, G. J., 1999, In: Networks. 33, 1, p. 57-70

  Research output: Contribution to journal › Article › peer-review

• OR Utopia

  Burkard, R. E., 1999, In: European Journal of Operational Research. 119, p. 224-234

  Research output: Contribution to journal › Article › peer-review

• QAPLIB- A quadratic assignment problem libraray

  Burkard, R. E., Karisch, S. & Rendl, F., 1999, In: European Journal of Operational Research. 55, p. 115-119

  Research output: Contribution to journal › Article › peer-review

• The Steiner tree problem in Kalmanson matrices and in circulant matrices

  Klinz, B. & Wöginger, G. J., 1999, In: Journal of Combinatorial Optimization . 3, p. 51-58

  Research output: Contribution to journal › Article › peer-review

• The traveling salesman problem on permuted Monge matrices

  Burkard, R. E., Deineko, V. & Wöginger, G. J., 1999, In: Journal of Combinatorial Optimization . 2, p. 333-350

  Research output: Contribution to journal › Article › peer-review

• Volume maximization and orthoconvex approximation of orthogons

  Burkard, R. E. & Miatselski, M. M., 1999, In: Computing. 63, p. 317-330

  Research output: Contribution to journal › Article › peer-review

• Well-solvable Cases of Hard Combinatorial Optimization Problems - the Role of Special Cost Matrices and Related Input Restrictions

  Klinz, B., 1999

  Research output: Thesis › Habilitation
• 1998

  A linear Algorithm for the pos/neg-weighted 1-median problem on a cactus

  Burkard, R. E. & Krarup, J., 1998, In: Computing. 60, p. 193-215

  Research output: Contribution to journal › Article › peer-review

• A linear compound algorithm for uniform machines

  Burkard, R. E., He, Y. & Kellerer, H., 1998, In: Computing. 61, p. 1-9

  Research output: Contribution to journal › Article › peer-review

• A note on multifit scheduling for uniform machines

  Burkard, R. E. & He, Y., 1998, In: Computing. 61, p. 277-283

  Research output: Contribution to journal › Article › peer-review

• A process scheduling problem arising from chemical production planning

  Burkard, R. E., Klinz, B., Rudolf, R. & Wennink, M., 1998, In: Optimization methods & software. p. 175-196

  Research output: Contribution to journal › Article › peer-review

• A unified approach to simple special cases of extremal permutations

  Burkard, R. E., Dragoti-Cela, E., Demidenko, V. M., Metelski, N. N. & Wöginger, G. J., 1998, In: Optimization. 44, p. 123-138

  Research output: Contribution to journal › Article › peer-review

• One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs

  Klinz, B. & Wöginger, G. J., 1998, In: Operations Research Letters. 22, p. 119-127

  Research output: Contribution to journal › Article › peer-review

• On the traveling salesman problem with a relaxed Monge matrix

  Burkard, R. E. & Deineko, V., 1998, In: Information Processing Letters. 67, p. 231-237

  Research output: Contribution to journal › Article › peer-review

• Rounding strategies of mixed integer programs arising from chemical production planning

  Burkard, R. E., Kocher, M. & Rudolf, R., 1998, In: Yugoslav Journal of Operations Research. 8, p. 9-23

  Research output: Contribution to journal › Article › peer-review

• The computational complexity of multi-level programming problems revisited

  Dudas, T., Klinz, B. & Wöginger, G. J., 1998, Multilevel optimization: Algorithms and Applications. Dortrecht, New York: Kluwer Academic Publishers, Vol. 20. p. 165-179 (NONCONVEX OPTIMIZATION AND ITS APPLICATIONS).

  Research output: Chapter in Book/Report/Conference proceeding › Chapter

• The k-minimum spanning tree problem in graded matrices

  Dudas, T., Klinz, B. & Wöginger, G. J., 1998, In: Computers & Mathematics with Applications. 36, p. 61-67

  Research output: Contribution to journal › Article › peer-review

• The quadratic assignment problem with a monotone anti-Monge matrix and a symmetric toeplitz matrix: Easy and hard cases

  Burkard, R. E., Dragoti-Cela, E., Rothe, G. & Wöginger, G. J., 1998, In: Mathematical Programming. 82, p. 128-158

  Research output: Contribution to journal › Article › peer-review

• The simple block iterative algorithm of an extended entropy model and its convergence

  Tan, Z. & Burkard, R. E., 1998, In: Acta mathematicae applicatae Sinica / English series. 14, p. 96-105

  Research output: Contribution to journal › Article › peer-review

• The Travelling Salesman and the PQ-Tree

  Burkard, R. E., Deineko, V. & Wöginger, G. J., 1998, In: Mathematics of operations research. 23, p. 613-623

  Research output: Contribution to journal › Article › peer-review

• Well-solvable special cases of the TSP

  Burkard, R. E., Deineko, V., van Dal, R., van der Veen, J. & Wöginger, G. J., 1998, In: SIAM Review. 40, p. 496-546

  Research output: Contribution to journal › Article › peer-review
• 1997

  A general approach for identifying special cases of the traveling salesman problem with a fixed optimal tur

  Burkard, R. E., Demidenko, V. M. & Rudolf, R., 1997, In: OR transactions. 1, p. 41-53

  Research output: Contribution to journal › Article
• 1996

  A new efficiently solvable special case of the axial 3-dimensional assignment bottleneck problem

  Klinz, B. & Wöginger, G. J., 1996, In: Lecture Notes in Computer Science. 1120, p. 150-162

  Research output: Contribution to journal › Article › peer-review

• Perspectives of Monge properties in combinatorial optimization

  Burkard, R. E., Klinz, B. & Rudolf, R., 1996, In: Discrete Applied Mathematics. 70, p. 95-161

  Research output: Contribution to journal › Article › peer-review
• 1995

  On the recognition of bottleneck Monge matrices

  Klinz, B., Rudolf, R. & Wöginger, G. J., 1995, In: Discrete Applied Mathematics. 63, p. 43-74

  Research output: Contribution to journal › Article › peer-review