Rainer Burkard

Q: What Schools Are Affiliated With Rainer Burkard

Rainer Burkard is affiliated with the following schools: Graz University of Technology, University of Graz, University of Vienna

Rainer Burkard's AcademicInfluence.com Rankings

Rainer Burkard

Mathematics

#3924

World Rank

#5671

Historical Rank

Measure Theory

#2290

World Rank

#2744

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Rainer Burkard Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Rainer Ernst Burkard is an Austrian mathematician. His research interests include discrete optimization, graph theory, applied discrete mathematics, and applied number theory. He earned his Ph.D. from the University of Vienna in 1967 and received his habilitation from the University of Graz in 1971. From 1973–1981 Rainer Burkard was full professor of Applied Mathematics at the University of Cologne . Since 1981 Rainer Burkard is full professor with the Graz University of Technology.

(See a Problem?)

Rainer Burkard's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

QAPLIB – A Quadratic Assignment Problem Library (1997) (898)
Assignment Problems (1998) (693)
Quadratic Assignment Problems (1984) (449)
A thermodynamically motivated simulation procedure for combinatorial optimization problems (1984) (358)
Linear Assignment Problems and Extensions (1999) (340)
Perspectives of Monge Properties in Optimization (1996) (295)
The quickest flow problem (1993) (185)
8. Quadratic Assignment Problems: Algorithms (2009) (180)
Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey (1998) (165)
A heuristic for quadratic Boolean programs with applications to quadratic assignment problems (1983) (147)
QAPLIB-A quadratic assignment problem library (1991) (144)
Selected topics on assignment problems (2002) (144)
Numerical investigations on quadratic assignment problems (1978) (121)
Inverse median problems (2004) (106)
Lexicographic bottleneck problems (1991) (88)
Three-dimensional Axial Assignment Problems with Decomposable Cost Coefficients (1996) (79)
A linear algorithm for the pos/neg-weighted 1-median problem on a cactus (1998) (72)
The inverse 1-median problem on a cycle (2008) (69)
The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases (1996) (68)
Sandwich approximation of univariate convex functions with an application to separable convex programming (1991) (67)
Combinatorial algorithms for inverse absolute and vertex 1‐center location problems on trees (2011) (65)
Inverse p-median problems with variable edge lengths (2011) (63)
Inverse 1-center location problems with edge length augmentation on trees (2009) (58)
The Chinese Postman Problem (1980) (57)
Probabilistic asymptotic properties of some combinatorial optimization problems (1985) (56)
Review, extensions and computational comparison of MILP formulations for scheduling of batch processes (2005) (56)
Efficiently solvable special cases of bottleneck travelling salesman problems (1991) (55)
An algebraic approach to assignment problems (1977) (49)
The inverse Fermat-Weber problem (2010) (49)
Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees (2011) (44)
The Travelling Salesman and the PQ-Tree (1996) (42)
Travelling Salesman and Assignment Problems: A Survey (1979) (42)
The asymptotic probabilistic behaviour of quadratic sum assignment problems (1983) (41)
On latin squares and the facial structure of related polytopes (1986) (41)
2-Medians in trees with pos/neg weights (2000) (41)
Vehicle scheduling in two-cycle flexible manufacturing systems (1994) (40)
Finding all essential terms of a characteristic maxpolynomial (2003) (37)
Combinatorial and Global Optimization (2002) (37)
A Note on the Robust 1-Center Problem on Trees (2002) (36)
Monge properties, discrete convexity and applications (2007) (34)
On random quadratic bottleneck assignment problems (1982) (34)
Linear Approximations in a Dynamic Programming Approach for the Uncapacitated Single-Source Minimum Concave Cost Network Flow Problem in Acyclic Networks (2001) (33)
Robust location problems with pos/neg weights on a tree (2001) (32)
Heuristics for biquadratic assignment problems and their computational comparison (1995) (32)
Computational investigations on 3-dimensional axial assignment problems (1993) (31)
A linear time algorithm for inverse obnoxious center location problems on networks (2013) (31)
Combinatorial optimization in linearly ordered semimodules: A survey (1982) (31)
Inverse median location problems with variable coordinates (2010) (30)
Max algebra and the linear assignment problem (2003) (30)
Hamiltonian cycles in circulant digraphs with two stripes (1997) (29)
Optimal schedules for periodically recurring events (1986) (28)
Weakly admissible transformations for solving algebraic assignment and transportation problems (1980) (27)
Reverse 2-median problem on trees (2008) (26)
The Travelling Salesman Problem on Permuted (1999) (26)
Mathematical programs with a two-dimensional reverse convex constraint (1991) (25)
On the Biquadratic Assignment Problem (1993) (24)
Weight reduction problems with certain bottleneck objectives (2004) (23)
A linear time algorithm for the reverse 1‐median problem on a cycle (2006) (23)
A general Hungarian method for the algebraic transportation problem (1978) (23)
A note on Hamiltonian split graphs (1980) (23)
Computational mathematics driven by industrial problems (2000) (23)
The p-maxian problem on a tree (2007) (23)
Efficiency and Optimality in Minisum, Minimax 0-1 Programming Problems (1982) (22)
Cyclic schedules for r irregularly occurring events (1990) (22)
Algorithms — ESA '97 (1997) (21)
A polynomial method for the pos/neg weighted 3-median problem on a tree (2007) (21)
Rounding strategies for mixed integer programs arising from chemical production planning (1998) (20)
Inverse 1-median problems (2008) (20)
A complex time based construction heuristic for batch scheduling problems in the chemical industry (2006) (20)
Makespan minimization for chemical batch processes using non-uniform time grids (2002) (19)
Center problems with pos/neg weights on trees (2003) (19)
A Relationship between optimality and efficiency in multicriteria 0-1 programming problems (1981) (19)
The Obnoxious Center Problem on a Tree (2001) (19)
Vehicle routing in an automated warehouse: Analysis and optimization (1995) (18)
Minimal cost flows in regular matroids (1981) (16)
Universal Conditions for Algebraic Traveling Salesman Problems to be Efficiently Solvable (1991) (16)
Assignment problems: Recent solution methods and applications (1986) (15)
Time-slot assignment for TDMA-systems (1985) (15)
The Travelling Salesman Problem on Permuted Monge Matrices (1998) (14)
Bottleneck Capacity Expansion Problems with General Budget Constraints (2001) (14)
The Linear Sum Assignment Problem (1980) (13)
A note on MULTIFIT scheduling for uniform machines (1998) (13)
On general decomposition schemes in mathematical programming (1985) (13)
SPECIAL CASES OF TRAVELLING SALESMAN PROBLEMS AND HEURISTICS (1990) (12)
Median problems with positive and negative weights on cycles and cacti (2010) (12)
2. Theoretical Foundations (2009) (12)
The inverse-parametric knapsack problem (1995) (12)
An ant colony algorithm for the pos/neg weighted p-median problem (2006) (12)
A linear compound algorithm for uniform machine scheduling (1998) (11)
Fog Deposition Measurements with the Eddy Covariance Method (2001) (10)
Bounded Space On-Line Variable-Sized Bin Packing (1997) (10)
Bounds on the radius and status of graphs (2014) (10)
On abstract duality in mathematical programming (1982) (10)
Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood (1995) (9)
Efficiently solvable special cases of hard combinatorial optimization problems (1997) (9)
On the Traveling Salesman Problem with a Relaxed Monge Matrix (1998) (9)
Erratum: The Travelling Salesman and the PQ-Tree (1999) (9)
An asymptotical study of combinatorial optimization problems by means of statistical mechanics (2006) (9)
Admissible Transformations and Assignment Problems (2007) (8)
The Solution of Algebraic Assignment and Transportation Problems (1978) (8)
OR Utopia (1999) (7)
Discrete optimization models for treatment planning in radiation therapy (1995) (7)
Polynomially solvable special cases of the quadratic bottleneck assignment problem (2011) (7)
Constrained Steiner trees in Halin graphs (2003) (7)
Constrained partitioning problems (1990) (7)
A transportation problem with a permuted demand vector (1999) (6)
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms (1999) (6)
A unified approach to simple special cases of extremal permutation problems (1998) (6)
Minimum-cost strong network orientation problems : classification, complexity, and algorithms (1999) (6)
On the role of bottleneck Monge matrices in combinatorial optimization (1995) (6)
A linear time algorithm for the reverse 1-median problem on a cycle (2006) (5)
Optimierung Und Kontrolle Projektbereich Diskrete Optimierung the Quadratic Assignment Problem with an Anti-monge Matrix and a Toeplitz Matrix: Easy and Hard Cases the Quadratic Assignment Problem with an Anti-monge and a Toeplitz Matrix: Easy and Hard Cases (2007) (5)
ECCO X: advances in theory and practice of combinatorial optimization (2000) (4)
Algebraic and combinatorial methods in operations research : proceedings of the Workshop on Algebraic Structures in Operations Research (1984) (4)
The inverse 1-center location problem on a tree (2009) (4)
Recent advances in theory and practice of combinatorial optimization (ECCO X) (2000) (4)
Cut and patch Steiner trees for ladders (1996) (4)
Shortest polygonal paths in space (1990) (4)
Combinatorial Online Optimization in Practice (1998) (4)
Steiner Minimum Trees for Equidistant Points on Two Sides of an Angle (1996) (3)
Fog deposition of nutrients and pollutants to a montane forest site (2001) (3)
Reshipments and overshipments in transportation problems with minimax objective (1991) (3)
10. Multi-Index Assignment Problems (2009) (3)
Graph algorithms in computer science (1989) (3)
A General Approach for Identifying Special Cases of the Travelling Salesman Problem with a Fixed Optimal Tour (1997) (3)
Communication Network Assignment Problem (2009) (3)
A minimax assignment problem in treelike communication networks (1995) (3)
On-line waste management in a galvanization plant (1997) (3)
7. Quadratic Assignment Problems: Formulations and Bounds (2009) (3)
The Sum Matching Problem (1980) (3)
A method for mixed integer convex programming (1973) (2)
Location problems: from classical geometry to managerial decisions (2000) (2)
Eigenfunctions and optimal orbits (1984) (2)
Time Division Multiple Access Systems and Matrix Decomposition (1991) (2)
A Communication Assignment Problem on Trees: Heuristics and Asymptotic Behavior (1997) (2)
An Event-Driven Model for Chemical Batch Processes (2000) (2)
Integer Programming and Combinatorial Optimization (1999) (2)
The web proxy location problem in general tree of rings networks (2006) (2)
The travelling salesman problem (2002) (2)
The Linear Bottleneck Assignment Problem (1980) (2)
Constrained partitioning problems: Discrete Applied Mathematics 28 (1990) 21–34 (1993) (1)
On the Biquadratic Assignment Problem on the Biquadratic Assignment Problem (1993) (1)
Nonlinear programming: Theory and algorithms: M.S. BAZARAA and C.M. SHETTY Wiley, Chichester, 1979, xiv + 560 pages, £15.00. (1980) (1)
Convexity and Discrete Optimization (1993) (1)
Mathematics of industrial systems III (1998) (1)
Some relationships between multicriteria and parametric discrete optimization problems with bottleneck objectives (1984) (1)
6. Other Types of Linear Assignment Problems (2009) (1)
Inverse center location problems (2010) (1)
On the Euclidean TSP with a permuted Van der Veen matrix (2004) (1)
The Bottleneck Matching Problem (1980) (1)
Biquadratic assignment problems (1994) (1)
The simple block iterative algorithm of an extended entropy model and its convergence (1998) (0)
Book review (1990) (0)
ON-LINE WASTE MANAGEMENTIN A GALVANIZATION PLANT (1997) (0)
Semi-Infinite Programming for solving Linear Fractional Programming with Fuzzy Parameters in Constraints (2007) (0)
Erratum: Constrained Partitioning Problems (1993) (0)
The Role of Cloud and Fog Water Inputs in the Hydrological Budget of a Tropical Cloud Forest Ecosystem in Costa Rica (2003) (0)
Weight redu tion problems with bottlene k obje tive (2001) (0)
Book reviews (1991) (0)
Tropical Montane Cloud Forests: Understanding the role of fog in forest hydrology: stable isotopes as tools for determining input and partitioning of cloud water in montane forests (2011) (0)
Ion Loads in Tropical Cloud Forests in Puerto Rico and Costa Rica and Tracer Techniques to Assess Throughfall (2006) (0)
Wet and Occult Ion Deposition To An Elevated Forest Ecosystem In Switzerland (2002) (0)
Preface: Mathematics of Industrial Systems III (1998) (0)
Modelling and Optimizing Batch Processes in the Chemical Industry (2007) (0)
The Role of Convexity in Discrete Optimization (1992) (0)
5. Further Results on the Linear Sum Assignment Problem (2009) (0)
[The drinking water supply in Baden-Württemberg--regional structures and trends in composition]. (1986) (0)
The Cardinality Matching Problem (1980) (0)
Buchbesprechungen (1982) (0)
4. Mathematical Programming Seminar (1981) (0)
Integer Programming and Combinatorial Optimization (2001) (0)
Optimierung Und Kontrolle Projektbereich Diskrete Optimierung Linear Assignment Problems and Extensions Linear Assignment Problems and Extensions (1998) (0)
und mathematische Modellierung Inverse Median Location Problems with Variable Coordinates (2009) (0)
Optimierung Und Kontrolle Projektbereich Diskrete Optimierung Eeciently Solvable Special Cases of Hard Combinatorial Optimization Problems Eeciently Solvable Special Cases of Hard Combinatorial Optimization Problems (2007) (0)
Admissible Transformations and their Application to Matching Problems (1981) (0)
V. symposium on operations research : Gesellschaft für Mathematik, Ökonomie und operations, research e.V. Universität zu Köln, August 25-27, 1980, Proceedings (1981) (0)
An application of algebraic transportation problems to scheduling problems (1978) (0)
Chapter 2 ( GENERALIZED ) CONVEXITY AND DISCRETE OPTIMIZATION (2006) (0)
Book reviews (1983) (0)
9. Other Types of Quadratic Assignment Problems (2009) (0)
Kovács, L. B., Combinatorial Methods of Discrete Programming, Mathematical Methods of Operations Research 2, Budapest, Akadémiai Kiadó 1980, 283 S., ISBN 963 05 2004 4 (1981) (0)
Volume Maximization and Orthoconvex Approximation of Orthogons (1999) (0)
Preface (2005) (0)
Vehicle Routing in an Automated Warehouse : (1994) (0)
Preface (1997) (0)
Book reviews (1985) (0)
Shortest-Path Algorithms (1991) (0)
Book reviews (1983) (0)
Discrete optimization: An Austrian view (2007) (0)
The obnoxious enter problem on a tree (2001) (0)
Proceedings of the 5th Annual European Symposium on Algorithms (1997) (0)
Buchbesprechungen (1995) (0)
Generalized) Convexity and Discrete Optimization (2005) (0)
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization (1999) (0)
Minimization of noise in tree-like communication structures (1995) (0)
A linear time algorithm for inverse obnoxious center location problems on networks (2012) (0)
Buchbesprechungen (1978) (0)
Saddlepoints in group and semigroup minimization (1988) (0)
Book review (1996) (0)
Re-Assessing the Measurement of Fogwater Inputs to a Tropical Ecosystem (2002) (0)
3. Bipartite Matching Algorithms (2009) (0)
Waste treatment in a metal-processing plant (1997) (0)
Trees and paths: graph optimisation problems with industrial applications (2000) (0)
Preface (2001) (0)
QAP Heuristic 1: The method of increasing degree of freedom (1980) (0)
QAP Heuristic 2: Cutting plane and exchange method (1980) (0)
Preface (1995) (0)
Book reviewIX. Oberwolfach conference on operations research, October 15–21, 1978: Rudolf Henn, Hans Paul Künzi and Horst Schubert (Eds.) Volume 36 in: Methods of Operations Research, Hain, Königstein, 1980, 326 pages, DM 89.00 (1981) (0)
Computational mathematics driven by industrial problems : lectures given at the 1st session of the Centro Internazionale Matematico Estivo (C.I.M.E.) held in Martina Franca, Italy, June 21-27, 1999 (2000) (0)

This paper list is powered by the following services:

Other Resources About Rainer Burkard

en.wikipedia.org

What Schools Are Affiliated With Rainer Burkard?

Rainer Burkard is affiliated with the following schools: