Untersuchungen zum Optimum-Mix Problem. - Rainer E. Burkard (Unternehmensforschung, 1970)

Algorithmus 25 Verfahren zur gemischt-ganzzahligen, konvexen Optimierung. - Rainer E. Burkard; H. Enge (Computing, 1975)

Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme. - Rainer E. Burkard (Z. Oper. Research, 1975)

Buchbesprechungen. - Helmuth Späth; Helmut Wegmann; K. Fallaschinski; F. Münnich; Rainer E. Burkard; Thomas M. Liebling; Wolfgang Bühler; Josef Heinhold; K. Eicher; H. Läpple (Z. Oper. Research, 1975)

Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme. - Rainer E. Burkard; Josef Offermann (Math. Methods Oper. Res., 1977)

An algebraic approach to assignment problems. - Rainer E. Burkard; Willi Hahn; Uwe Zimmermann (Math. Program., 1977)

A general Hungarian method for the algebraic transportation problem. - Rainer E. Burkard (Discret. Math., 1978)

Buchbesprechungen. - H. Helmut Merkel; H. Läpple; Peter Hammann; Heiner Müller-Merbach; Werner Krabs; Günter Fandel; Gert Dehnert; Rainer E. Burkard; B. Jahnke; R. Cremer; H. Sommer (Z. Oper. Research, 1978)

A note on Hamiltonian split graphs. - Rainer E. Burkard; Peter L. Hammer (J. Comb. Theory B, 1980)

A Relationship between optimality and efficiency in multicriteria 0-1 programming problems. - Rainer E. Burkard; Hans Keiding; Peter M. Pruzan; Jakob Krarup (Comput. Oper. Res., 1981)

Buchbesprechungen. - P. van Beek; Peter Hammann; Rainer E. Burkard; Hans Ziegler; A. Bachem (Z. Oper. Research, 1982)

On abstract duality in mathematical programming. - Rainer E. Burkard; Horst W. Hamacher; Jørgen Tind (Z. Oper. Research, 1982)

On random quadratic bottleneck assignment problems. - Rainer E. Burkard; Ulrich Fincke (Math. Program., 1982)

The asymptotic probabilistic behaviour of quadratic sum assignment problems. - Rainer E. Burkard; Ulrich Fincke (Z. Oper. Research, 1983)

Book reviews. - B. Nagels; B. Wobith; Mynt Zijlstra; Rainer E. Burkard; Hans Ziegler; Gustav Feichtinger (Z. Oper. Research, 1983)

Time-slot assignment for TDMA-systems. - Rainer E. Burkard (Computing, 1985)

Probabilistic asymptotic properties of some combinatorial optimization problems. - Rainer E. Burkard; Ulrich Fincke (Discret. Appl. Math., 1985)

Book reviews. - Franz Josef Radermacher; Thomas M. Liebling; Hansjörg Wacker; Siegfried Schaible; Rainer E. Burkard; A. Aigner; Raymond A. Cuninghame-Green (Z. Oper. Research, 1985)

Optimal schedules for periodically recurring events. - Rainer E. Burkard (Discret. Appl. Math., 1986)

On latin squares and the facial structure of related polytopes. - Reinhardt Euler; Rainer E. Burkard; R. Grommes (Discret. Math., 1986)

Shortest polygonal paths in space. - Rainer E. Burkard; Günter Rote; En-Yu Yao; Zhongliang Yu 001 (Computing, 1990)

Constrained partitioning problems. - Rainer E. Burkard; En-Yu Yao (Discret. Appl. Math., 1990)

Book review. - Rainer E. Burkard (ZOR Methods Model. Oper. Res., 1990)

Efficiently solvable special cases of bottleneck travelling salesman problems. - Rainer E. Burkard; W. Sandholzer (Discret. Appl. Math., 1991)

Mathematical programs with a two-dimensional reverse convex constraint. - Phan Thien Thach; Rainer E. Burkard; Werner Oettli (J. Glob. Optim., 1991)

Book reviews. - Rainer E. Burkard; Ulrich Faigle (ZOR Methods Model. Oper. Res., 1991)

Lexicographic bottleneck problems. - Rainer E. Burkard; Franz Rendl (Oper. Res. Lett., 1991)

On the Biquadratic Assignment Problem. - Rainer E. Burkard; Eranda Çela; Bettina Klinz (Quadratic Assignment and Related Problems, 1993)

Erratum: Constrained Partitioning Problems. - Rainer E. Burkard; En-Yu Yao (Discret. Appl. Math., 1993)

The quickest flow problem. - Rainer E. Burkard; Karin Dlaska; Bettina Klinz (ZOR Methods Model. Oper. Res., 1993)

Vehicle routing in an automated warehouse: Analysis and optimization. - Rainer E. Burkard; Bernd Fruhwirth; Günter Rote (Ann. Oper. Res., 1995)

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

On the role of bottleneck Monge matrices in combinatorial optimization. - Rainer E. Burkard (Oper. Res. Lett., 1995)

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

Perspectives of Monge Properties in Optimization. - Rainer E. Burkard; Bettina Klinz; Rüdiger Rudolf (Discret. Appl. Math., 1996)

Three-dimensional Axial Assignment Problems with Decomposable Cost Coefficients. - Rainer E. Burkard; Rüdiger Rudolf; Gerhard J. Woeginger (Discret. Appl. Math., 1996)

Cut and patch Steiner trees for ladders. - Rainer E. Burkard; Tibor Dudás; Thomas Maier (Discret. Math., 1996)

Bounded Space On-Line Variable-Sized Bin Packing. - Rainer E. Burkard; Guochuan Zhang (Acta Cybern., 1997)

Preface. - Rainer E. Burkard; Toshihide Ibaraki; Maurice Queyranne (Ann. Oper. Res., 1997)

Hamiltonian cycles in circulant digraphs with two stripes. - Qi Fan Yang; Rainer E. Burkard; Eranda Çela; Gerhard J. Woeginger (Discret. Math., 1997)

QAPLIB - A Quadratic Assignment Problem Library. - Rainer E. Burkard; Stefan E. Karisch; Franz Rendl (J. Glob. Optim., 1997)

Efficiently solvable special cases of hard combinatorial optimization problems. - Rainer E. Burkard (Math. Program., 1997)

Assignment Problems. - Rainer E. Burkard (IFIP Congress: Fundamentals - Foundations of Computer Science, 1998)

Preface: Mathematics of Industrial Systems III. - Rainer E. Burkard; Toshihide Ibaraki; William R. Pulleyblank (Ann. Oper. Res., 1998)

A Note on MULTIFIT Scheduling for Uniform Machines. - Rainer E. Burkard; Y. He (Computing, 1998)

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

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

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

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

The Travelling Salesman and the PQ-Tree. - Rainer E. Burkard; Vladimir G. Deineko; Gerhard J. Woeginger (Math. Oper. Res., 1998)

The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases. - Rainer E. Burkard; Eranda Çela; Günter Rote; Gerhard J. Woeginger (Math. Program., 1998)

Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey. - Rainer E. Burkard; Vladimir G. Deineko; René van Dal; Jack A. A. van der Veen; Gerhard J. Woeginger (SIAM Rev., 1998)

Linear Assignment Problems and Extensions. - Rainer E. Burkard; Eranda Çela (Handbook of Combinatorial Optimization, 1999)

Volume Maximization and Orthoconvex Approximation of Orthogons. - Rainer E. Burkard; M. M. Miatselski (Computing, 1999)

OR Utopia. - Rainer E. Burkard (Eur. J. Oper. Res., 1999)

A transportation problem with a permuted demand vector. - Steffen G. Meusel; Rainer E. Burkard (Math. Methods Oper. Res., 1999)

Erratum: The Travelling Salesman and the PQ-Tree. - Rainer E. Burkard; Vladimir G. Deineko; Gerhard J. Woeginger (Math. Oper. Res., 1999)

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

2-Medians in trees with pos/neg weights. - Rainer E. Burkard; Eranda Çela; Helidon Dollani (Discret. Appl. Math., 2000)

Recent advances in theory and practice of combinatorial optimization (ECCO X). - Rainer E. Burkard; Martine Labbé; M. Teresa Ramos; Joaquin Sicilia (Eur. J. Oper. Res., 2000)

Preface. - Henrik Blank; Rainer E. Burkard; Gautam Mitra; Toshihide Ibaraki; Steven D. Noble; William R. Pulleyblank (Ann. Oper. Res., 2001)

Linear Approximations in a Dynamic Programming Approach for the Uncapacitated Single-Source Minimum Concave Cost Network Flow Problem in Acyclic Networks. - Rainer E. Burkard; Helidon Dollani; Phan Thien Thach (J. Glob. Optim., 2001)

Robust location problems with pos/neg weights on a tree. - Rainer E. Burkard; Helidon Dollani (Networks, 2001)

Bottleneck Capacity Expansion Problems with General Budget Constraints. - Rainer E. Burkard; Bettina Klinz; Jianzhong Zhang 001 (RAIRO Oper. Res., 2001)

The Obnoxious Center Problem on a Tree. - Rainer E. Burkard; Helidon Dollani; Yixun Lin; Günter Rote (SIAM J. Discret. Math., 2001)

A Note on the Robust 1-Center Problem on Trees. - Rainer E. Burkard; Helidon Dollani (Ann. Oper. Res., 2002)

Selected topics on assignment problems. - Rainer E. Burkard (Discret. Appl. Math., 2002)

Finding all essential terms of a characteristic maxpolynomial. - Rainer E. Burkard; Peter Butkovic (Discret. Appl. Math., 2003)

Center problems with pos/neg weights on trees. - Rainer E. Burkard; Helidon Dollani (Eur. J. Oper. Res., 2003)

Max algebra and the linear assignment problem. - Rainer E. Burkard; Peter Butkovic (Math. Program., 2003)

Constrained Steiner trees in Halin graphs. - Guangting Chen; Rainer E. Burkard (RAIRO Oper. Res., 2003)

Inverse median problems. - Rainer E. Burkard; Carmen Pleschiutschnig; Jianzhong Zhang 001 (Discret. Optim., 2004)

Weight reduction problems with certain bottleneck objectives. - Rainer E. Burkard; Yixun Lin; Jianzhong Zhang 001 (Eur. J. Oper. Res., 2004)

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

Review, extensions and computational comparison of MILP formulations for scheduling of batch processes. - Rainer E. Burkard; Johannes Hatzl (Comput. Chem. Eng., 2005)

Preface. - Rainer E. Burkard (Math. Methods Oper. Res., 2005)

An ant colony algorithm for the pos/neg weighted p-median problem. - Jafar Fathali; Hossein Taghizadeh Kakhki; Rainer E. Burkard (Central Eur. J. Oper. Res., 2006)

A complex time based construction heuristic for batch scheduling problems in the chemical industry. - Rainer E. Burkard; Johannes Hatzl (Eur. J. Oper. Res., 2006)

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

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

Discrete optimization: An Austrian view. - Rainer E. Burkard (Ann. Oper. Res., 2007)

Monge properties, discrete convexity and applications. - Rainer E. Burkard (Eur. J. Oper. Res., 2007)

A polynomial method for the pos/neg weighted 3-median problem on a tree. - Rainer E. Burkard; Jafar Fathali (Math. Methods Oper. Res., 2007)

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

Reverse 2-median problem on trees. - Rainer E. Burkard; Elisabeth Gassner; Johannes Hatzl (Discret. Appl. Math., 2008)

The inverse 1-median problem on a cycle. - Rainer E. Burkard; Carmen Pleschiutschnig; Jianzhong Zhang 001 (Discret. Optim., 2008)

Assignment Problems. - Rainer E. Burkard; Mauro Dell'Amico; Silvano Martello (SIAM, 2009)

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

Communication Network Assignment Problem. - Rainer E. Burkard (Encyclopedia of Optimization, 2009)

Inverse median location problems with variable coordinates. - Fahimeh Baroughi Bonab; Rainer E. Burkard; Behrooz Alizadeh (Central Eur. J. Oper. Res., 2010)

Inverse center location problems. - Rainer E. Burkard; Behrooz Alizadeh (Electron. Notes Discret. Math., 2010)

The inverse Fermat-Weber problem. - Rainer E. Burkard; Mohammadreza Galavii; Elisabeth Gassner (Eur. J. Oper. Res., 2010)

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

Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees. - Behrooz Alizadeh; Rainer E. Burkard (Discret. Appl. Math., 2011)

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

Inverse p-median problems with variable edge lengths. - Fahimeh Baroughi Bonab; Rainer E. Burkard; Elisabeth Gassner (Math. Methods Oper. Res., 2011)

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

A linear time algorithm for inverse obnoxious center location problems on networks. - Behrooz Alizadeh; Rainer E. Burkard (Central Eur. J. Oper. Res., 2013)

Bounds on the radius and status of graphs. - Roswitha Rissner; Rainer E. Burkard (Networks, 2014)