Rainer E. Burkard

Behrooz Alizadeh, Rainer E. Burkard: Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees. Discrete Applied Mathematics 159(8): 706-716 (2011)

Rainer E. Burkard, Roswitha Rissner: Polynomially solvable special cases of the quadratic bottleneck assignment problem. J. Comb. Optim. 22(4): 845-856 (2011)

Fahimeh Baroughi Bonab, Rainer E. Burkard, Elisabeth Gassner: Inverse p-median problems with variable edge lengths. Math. Meth. of OR 73(2): 263-280 (2011)

Behrooz Alizadeh, Rainer E. Burkard: Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees. Networks 58(3): 190-200 (2011)

Rainer E. Burkard, Behrooz Alizadeh: Inverse center location problems. Electronic Notes in Discrete Mathematics 36: 105-110 (2010)

Rainer E. Burkard, Mohammadreza Galavii, Elisabeth Gassner: The inverse Fermat-Weber problem. European Journal of Operational Research 206(1): 11-17 (2010)

Rainer E. Burkard, Johannes Hatzl: Median problems with positive and negative weights on cycles and cacti. J. Comb. Optim. 20(1): 27-46 (2010)

Rainer E. Burkard, Mauro Dell'Amico, Silvano Martello: Assignment Problems. SIAM 2009, isbn 978-0-89871-663-4, pp. I-XX, 1-382

Behrooz Alizadeh, Rainer E. Burkard, Ulrich Pferschy: Inverse 1-center location problems with edge length augmentation on trees. Computing 86(4): 331-343 (2009)

Rainer E. Burkard: Communication Network Assignment Problem. Encyclopedia of Optimization 2009: 394-396

Rainer E. Burkard, Elisabeth Gassner, Johannes Hatzl: Reverse 2-median problem on trees. Discrete Applied Mathematics 156(11): 1963-1976 (2008)

Rainer E. Burkard, Carmen Pleschiutschnig, Jianzhong Zhang: The inverse 1-median problem on a cycle. Discrete Optimization 5(2): 242-253 (2008)

Rainer E. Burkard: Discrete optimization: An Austrian view. Annals OR 149(1): 43-48 (2007)

Rainer E. Burkard: Monge properties, discrete convexity and applications. European Journal of Operational Research 176(1): 1-14 (2007)

Rainer E. Burkard, Jafar Fathali: A polynomial method for the pos/neg weighted 3-median problem on a tree. Math. Meth. of OR 65(2): 229-238 (2007)

Rainer E. Burkard, Jafar Fathali, Hossein Taghizadeh Kakhki: The p-maxian problem on a tree. Oper. Res. Lett. 35(3): 331-335 (2007)

Rainer E. Burkard, Johannes Hatzl: A complex time based construction heuristic for batch scheduling problems in the chemical industry. European Journal of Operational Research 174(2): 1162-1183 (2006)

Guangting Chen, Gu Zhang, Rainer E. Burkard: The web proxy location problem in general tree of rings networks. J. Comb. Optim. 12(4): 327-336 (2006)

Rainer E. Burkard, Elisabeth Gassner, Johannes Hatzl: A linear time algorithm for the reverse 1-median problem on a cycle. Networks 48(1): 16-23 (2006)

Rainer E. Burkard, Johannes Hatzl: Review, extensions and computational comparison of MILP formulations for scheduling of batch processes. Computers & Chemical Engineering 29(8): 1752-1769 (2005)

Rainer E. Burkard: Preface. Math. Meth. of OR 62(1): 1-2 (2005)

Rainer E. Burkard, Carmen Pleschiutschnig, Jianzhong Zhang: Inverse median problems. Discrete Optimization 1(1): 23-39 (2004)

Rainer E. Burkard, Yixun Lin, Jianzhong Zhang: Weight reduction problems with certain bottleneck objectives. European Journal of Operational Research 153(1): 191-199 (2004)

Rainer E. Burkard, Vladimir G. Deineko: On the Euclidean TSP with a permuted Van der Veen matrix. Inf. Process. Lett. 91(6): 259-262 (2004)

Rainer E. Burkard, Peter Butkovic: Finding all essential terms of a characteristic maxpolynomial. Discrete Applied Mathematics 130(3): 367-380 (2003)

Rainer E. Burkard, Helidon Dollani: Center problems with pos/neg weights on trees. European Journal of Operational Research 145(3): 483-495 (2003)

Rainer E. Burkard, Peter Butkovic: Max algebra and the linear assignment problem. Math. Program. 98(1-3): 415-429 (2003)

Guangting Chen, Rainer E. Burkard: Constrained Steiner trees in Halin graphs. RAIRO - Operations Research 37(3): 179-194 (2003)

Rainer E. Burkard, Helidon Dollani: A Note on the Robust 1-Center Problem on Trees. Annals OR 110(1-4): 69-82 (2002)

Rainer E. Burkard: Selected topics on assignment problems. Discrete Applied Mathematics 123(1-3): 257-302 (2002)

Henrik Blank, Rainer E. Burkard, Gautam Mitra, Toshihide Ibaraki, Steven Noble, William R. Pulleyblank: Preface. Annals OR 107(1-4): 13 (2001)

Rainer E. Burkard, Helidon Dollani: Robust location problems with pos/neg weights on a tree. Networks 38(2): 102-113 (2001)

Rainer E. Burkard, Bettina Klinz, Jianzhong Zhang: Bottleneck Capacity Expansion Problems with General Budget Constraints. RAIRO - Operations Research 35(1): 1-20 (2001)

Rainer E. Burkard, Helidon Dollani, Yixun Lin, Günter Rote: The Obnoxious Center Problem on a Tree. SIAM J. Discrete Math. 14(4): 498-509 (2001)

Rainer E. Burkard, Eranda Çela, Helidon Dollani: 2-Medians in trees with pos/neg weights. Discrete Applied Mathematics 105(1-3): 51-71 (2000)

Rainer E. Burkard, Martine Labbé, M. Teresa Ramos, Joaquin Sicilia: Recent advances in theory and practice of combinatorial optimization (ECCO X). European Journal of Operational Research 123(2): 227-228 (2000)

Rainer E. Burkard, M. M. Miatselski: Volume Maximization and Orthoconvex Approximation of Orthogons. Computing 63(4): 317-330 (1999)

Rainer E. Burkard: OR Utopia. European Journal of Operational Research 119(2): 224-234 (1999)

Steffen G. Meusel, Rainer E. Burkard: A transportation problem with a permuted demand vector. Math. Meth. of OR 50(1): 1-7 (1999)

Rainer E. Burkard, Karin Feldbacher, Bettina Klinz, Gerhard J. Woeginger: Minimum-cost strong network orientation problems: Classification, complexity, and algorithms. Networks 33(1): 57-70 (1999)

Gérard Cornuéjols, Rainer E. Burkard, Gerhard J. Woeginger (Eds.): Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings. Lecture Notes in Computer Science 1610, Springer 1999, isbn 3-540-66019-4

Rainer E. Burkard, Jakob Krarup: A Linear Algorithm for the Pos/Neg-Weighted 1-Median Problem on a Cactus. Computing 60(3): 193-216 (1998)

Rainer E. Burkard, Y. He, Hans Kellerer: A Linear Compound Algorithm for Uniform Machine Scheduling. Computing 61(1): 1-10 (1998)

Rainer E. Burkard, Y. He: A Note on MULTIFIT Scheduling for Uniform Machines. Computing 61(3): 277-283 (1998)

Rainer E. Burkard, Vladimir G. Deineko: On the Traveling Salesman Problem with a Relaxed Monge Matrix. Inf. Process. Lett. 67(5): 231-237 (1998)

Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger: The Travelling Salesman Problem on Permuted Monge Matrices. J. Comb. Optim. 2(4): 333-350 (1998)

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. Math. Program. 82: 125-158 (1998)

Rainer E. Burkard: Assignment Problems. IFIP Congress: Fundamentals - Foundations of Computer Science 1998: 49-62

Rainer E. Burkard, Guochuan Zhang: Bounded Space On-Line Variable-Sized Bin Packing. Acta Cybern. 13(1): 63-76 (1997)

Qi Fan Yang, Rainer E. Burkard, Eranda Çela, Gerhard J. Woeginger: Hamiltonian cycles in circulant digraphs with two stripes. Discrete Mathematics 176(1-3): 233-254 (1997)

Rainer E. Burkard: Efficiently solvable special cases of hard combinatorial optimization problems. Math. Program. 79: 55-69 (1997)

Rainer E. Burkard, Gerhard J. Woeginger (Eds.): Algorithms - ESA '97, 5th Annual European Symposium, Graz, Austria, September 15-17, 1997, Proceedings. Lecture Notes in Computer Science 1284, Springer 1997, isbn 3-540-63397-9

Rainer E. Burkard, Tibor Dudás: Steiner Minimum Trees for Equidistant Points on Two Sides of an Angle. Acta Cybern. 12(3): 313-324 (1996)

Rainer E. Burkard, Rüdiger Rudolf, Gerhard J. Woeginger: Three-dimensional Axial Assignment Problems with Decomposable Cost Coefficients. Discrete Applied Mathematics 65(1-3): 123-139 (1996)

Rainer E. Burkard, Bettina Klinz, Rüdiger Rudolf: Perspectives of Monge Properties in Optimization. Discrete Applied Mathematics 70(2): 95-161 (1996)

Rainer E. Burkard, Tibor Dudás, Thomas Maier: Cut and patch Steiner trees for ladders. Discrete Mathematics 161(1-3): 53-61 (1996)

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. IPCO 1996: 204-218

Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger: The Travelling Salesman and the PQ-Tree. IPCO 1996: 490-504

Rainer E. Burkard, Vladimir G. Deineko: Polynomially Solvable Cases of the Traveling Salesman Problem and a New Exponential Neighborhood. Computing 54(3): 191-212 (1995)

Rainer E. Burkard, En-Yu Yao: Erratum: Constrained Partitioning Problems. Discrete Applied Mathematics 46(2): 185 (1993)

Rainer E. Burkard, Karin Dlaska, Bettina Klinz: The quickest flow problem. Math. Meth. of OR 37(1): 31-58 (1993)

Rainer E. Burkard, W. Sandholzer: Efficiently solvable special cases of bottleneck travelling salesman problems. Discrete Applied Mathematics 32(1): 61-76 (1991)

Rainer E. Burkard, En-Yu Yao: Constrained partitioning problems. Discrete Applied Mathematics 28(1): 21-34 (1990)

Reinhardt Euler, Rainer E. Burkard, R. Grommes: On latin squares and the facial structure of related polytopes. Discrete Mathematics 62(2): 155-181 (1986)

Rainer E. Burkard, Hans Keiding, Peter M. Pruzan, Jakob Krarup: A Relationship between optimality and efficiency in multicriteria 0-1 programming problems. Computers & OR 8(4): 241-247 (1981)

Rainer E. Burkard, Peter L. Hammer: A note on Hamiltonian split graphs. J. Comb. Theory, Ser. B 28(2): 245-248 (1980)

Rainer E. Burkard, H. Enge: Algorithmus 25 Verfahren zur gemischt-ganzzahligen, konvexen Optimierung. Computing 14(4): 389-396 (1975)