Rainer E. Burkard

According to our database1, Rainer E. Burkard authored at least 101 papers between 1970 and 2014.

Collaborative distances:



In proceedings 
PhD thesis 



On csauthors.net:


Bounds on the radius and status of graphs.
Networks, 2014

A linear time algorithm for inverse obnoxious center location problems on networks.
CEJOR, 2013

Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees.
Networks, 2011

Inverse p-median problems with variable edge lengths.
Math. Meth. of OR, 2011

Polynomially solvable special cases of the quadratic bottleneck assignment problem.
J. Comb. Optim., 2011

Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees.
Discrete Applied Mathematics, 2011

Median problems with positive and negative weights on cycles and cacti.
J. Comb. Optim., 2010

The inverse Fermat-Weber problem.
European Journal of Operational Research, 2010

Inverse center location problems.
Electronic Notes in Discrete Mathematics, 2010

Inverse median location problems with variable coordinates.
CEJOR, 2010

Communication Network Assignment Problem.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Inverse 1-center location problems with edge length augmentation on trees.
Computing, 2009

Assignment Problems.
SIAM, ISBN: 978-0-89871-663-4, 2009

The inverse 1-median problem on a cycle.
Discrete Optimization, 2008

Reverse 2-median problem on trees.
Discrete Applied Mathematics, 2008

The p-maxian problem on a tree.
Oper. Res. Lett., 2007

A polynomial method for the pos/neg weighted 3-median problem on a tree.
Math. Meth. of OR, 2007

Monge properties, discrete convexity and applications.
European Journal of Operational Research, 2007

Discrete optimization: An Austrian view.
Annals OR, 2007

A linear time algorithm for the reverse 1-median problem on a cycle.
Networks, 2006

The web proxy location problem in general tree of rings networks.
J. Comb. Optim., 2006

A complex time based construction heuristic for batch scheduling problems in the chemical industry.
European Journal of Operational Research, 2006

An ant colony algorithm for the pos/neg weighted p-median problem.
CEJOR, 2006

Math. Meth. of OR, 2005

Review, extensions and computational comparison of MILP formulations for scheduling of batch processes.
Computers & Chemical Engineering, 2005

On the Euclidean TSP with a permuted Van der Veen matrix.
Inf. Process. Lett., 2004

Weight reduction problems with certain bottleneck objectives.
European Journal of Operational Research, 2004

Inverse median problems.
Discrete Optimization, 2004

Constrained Steiner trees in Halin graphs.
RAIRO - Operations Research, 2003

Max algebra and the linear assignment problem.
Math. Program., 2003

Center problems with pos/neg weights on trees.
European Journal of Operational Research, 2003

Finding all essential terms of a characteristic maxpolynomial.
Discrete Applied Mathematics, 2003

Selected topics on assignment problems.
Discrete Applied Mathematics, 2002

A Note on the Robust 1-Center Problem on Trees.
Annals OR, 2002

The Obnoxious Center Problem on a Tree.
SIAM J. Discrete Math., 2001

Bottleneck Capacity Expansion Problems with General Budget Constraints.
RAIRO - Operations Research, 2001

Robust location problems with pos/neg weights on a tree.
Networks, 2001

Linear Approximations in a Dynamic Programming Approach for the Uncapacitated Single-Source Minimum Concave Cost Network Flow Problem in Acyclic Networks.
J. Global Optimization, 2001

Annals OR, 2001

Recent advances in theory and practice of combinatorial optimization (ECCO X).
European Journal of Operational Research, 2000

2-Medians in trees with pos/neg weights.
Discrete Applied Mathematics, 2000

Minimum-cost strong network orientation problems: Classification, complexity, and algorithms.
Networks, 1999

Erratum: The Travelling Salesman and the PQ-Tree.
Math. Oper. Res., 1999

A transportation problem with a permuted demand vector.
Math. Meth. of OR, 1999

OR Utopia.
European Journal of Operational Research, 1999

Volume Maximization and Orthoconvex Approximation of Orthogons.
Computing, 1999

Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey.
SIAM Review, 1998

The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases.
Math. Program., 1998

The Travelling Salesman and the PQ-Tree.
Math. Oper. Res., 1998

The Travelling Salesman Problem on Permuted Monge Matrices.
J. Comb. Optim., 1998

On the Traveling Salesman Problem with a Relaxed Monge Matrix.
Inf. Process. Lett., 1998

A Linear Algorithm for the Pos/Neg-Weighted 1-Median Problem on a Cactus.
Computing, 1998

A Linear Compound Algorithm for Uniform Machine Scheduling.
Computing, 1998

A Note on MULTIFIT Scheduling for Uniform Machines.
Computing, 1998

Preface: Mathematics of Industrial Systems III.
Annals OR, 1998

Assignment Problems.
Proceedings of the Fundamentals - Foundations of Computer Science, 1998

Efficiently solvable special cases of hard combinatorial optimization problems.
Math. Program., 1997

QAPLIB - A Quadratic Assignment Problem Library.
J. Global Optimization, 1997

Hamiltonian cycles in circulant digraphs with two stripes.
Discrete Mathematics, 1997

Bounded Space On-Line Variable-Sized Bin Packing.
Acta Cybern., 1997

Book review.
J. Global Optimization, 1996

Cut and patch Steiner trees for ladders.
Discrete Mathematics, 1996

Three-dimensional Axial Assignment Problems with Decomposable Cost Coefficients.
Discrete Applied Mathematics, 1996

Perspectives of Monge Properties in Optimization.
Discrete Applied Mathematics, 1996

Steiner Minimum Trees for Equidistant Points on Two Sides of an Angle.
Acta Cybern., 1996

The Travelling Salesman and the PQ-Tree.
Proceedings of the Integer Programming and Combinatorial Optimization, 1996

The Quadratic Assignment Problem with a Monotone Anti-Monge and a Symmetric Toeplitz Matrix: Easy and Hard Cases.
Proceedings of the Integer Programming and Combinatorial Optimization, 1996

On the role of bottleneck Monge matrices in combinatorial optimization.
Oper. Res. Lett., 1995

Polynomially Solvable Cases of the Traveling Salesman Problem and a New Exponential Neighborhood.
Computing, 1995

Annals OR, 1995

Vehicle routing in an automated warehouse: Analysis and optimization.
Annals OR, 1995

The quickest flow problem.
ZOR - Meth. & Mod. of OR, 1993

Erratum: Constrained Partitioning Problems.
Discrete Applied Mathematics, 1993

On the Biquadratic Assignment Problem.
Proceedings of the Quadratic Assignment and Related Problems, 1993

Lexicographic bottleneck problems.
Oper. Res. Lett., 1991

Book reviews.
ZOR - Meth. & Mod. of OR, 1991

Mathematical programs with a two-dimensional reverse convex constraint.
J. Global Optimization, 1991

Efficiently solvable special cases of bottleneck travelling salesman problems.
Discrete Applied Mathematics, 1991

Book review.
ZOR - Meth. & Mod. of OR, 1990

Constrained partitioning problems.
Discrete Applied Mathematics, 1990

Shortest polygonal paths in space.
Computing, 1990

On latin squares and the facial structure of related polytopes.
Discrete Mathematics, 1986

Optimal schedules for periodically recurring events.
Discrete Applied Mathematics, 1986

Book reviews.
Zeitschr. für OR, 1985

Probabilistic asymptotic properties of some combinatorial optimization problems.
Discrete Applied Mathematics, 1985

Time-slot assignment for TDMA-systems.
Computing, 1985

Book reviews.
Zeitschr. für OR, 1983

The asymptotic probabilistic behaviour of quadratic sum assignment problems.
Zeitschr. für OR, 1983

On random quadratic bottleneck assignment problems.
Math. Program., 1982

On abstract duality in mathematical programming.
Zeitschr. für OR, 1982

Zeitschr. für OR, 1982

A Relationship between optimality and efficiency in multicriteria 0-1 programming problems.
Computers & OR, 1981

A note on Hamiltonian split graphs.
J. Comb. Theory, Ser. B, 1980

Zeitschr. für OR, 1978

A general Hungarian method for the algebraic transportation problem.
Discrete Mathematics, 1978

An algebraic approach to assignment problems.
Math. Program., 1977

Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme.
Math. Meth. of OR, 1977

Zeitschr. für OR, 1975

Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme.
Zeitschr. für OR, 1975

Algorithmus 25 Verfahren zur gemischt-ganzzahligen, konvexen Optimierung.
Computing, 1975

Untersuchungen zum Optimum-Mix Problem.
Unternehmensforschung, 1970