Burkard Rainer E.

Rainer E. Burkard

Information about the author Rainer E. Burkard will soon be added to the site.
Found 27 papers in total
The inverse 1-median problem on a cycle
2008
Let the graph G=(V,E) be a cycle with n +1 vertices, non-negative vertex weights...
The reel and sheet cutting problem in paper industry
2005
An important problem in paper industry is the sheet production: so-called master reels...
Monge properties, discrete convexity and applications
2007
Starting from Monge's mass transportation problem we review the role Monge properties...
The p-median problem on a tree
2007
It is shown that the leaves of a longest path provide an optimal solution for the...
Discrete optimization: An Austrian view
2007
This paper is one in a special issue of Annals of Operations Research devoted to the...
The web proxy location problem in general tree of rings networks
2006
The Web proxy location problem in general networks is an NP-hard problem. In this...
An ant colony algorithm for the pos/neg weighted p-median problem
2006
Let a graph G = (V, E) with vertex set V and edge set E be given. The classical...
Constrained Steiner trees in Halin graphs
2003
In this paper, we study the problem of computing a minimum cost Steiner tree subject...
Bottleneck capacity expansion problems with general budget constraints
2001
This paper presents a unified approach for bottleneck capacity expansion problems. In...
Weight reduction problems with certain bottleneck objectives
2004
This paper is concerned with bottleneck weight reduction problems (WRPs) stated as...
A note on the robust 1-center problem on trees
2002
We consider the robust 1-center problem on trees with uncertainty in vertex weights...
Robust location problems with pos/neg weights on a tree
2001
In this paper, we consider different aspects of robust 1-median problems on a tree...
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
1999
In the minimum-cost strong network orientation problem (MCSO), we are given an...
Location problems: From classical geometry to managerial decisions
2000
We sketch the development of location problems from the beginnings in the 17th century...
OR utopia
1999
An utopian form of the OR community is described. We discuss the fractal borders of...
The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
1998
This paper investigates a restricted version of the Quadratic Assignment Problem...
Well-solvable special cases of the traveling salesman problem: A survey
1998
The traveling salesman problem belongs to the most basic, most important, and most...
Efficiently solvable special cases of hard combinatorial optimization problems
1997
We survey some recent advances in the field of polynomially solvable special cases of...
Rounding strategies for mixed integer programs arising from chemical production planning
1998
In this paper we consider problems which stem from production planning processes in...
The inverse-parametric knapsack problem
1995
This paper deals with parametric knapsack problems where the costs or weights are...
Heuristics for biquadratic assignment problems and their computational comparison
1995
The biquadratic assignment problem (BiQAP) is a generalization of the quadratic...
A minimax assignment problem in treelike communication networks
1995
A given system of communication centres C 1 , C 2...
On-line waste management in a galvanization plant
1997
In this paper the authors present a case study of a waste-water treatment procedure...
On the role of bottleneck Monge matrices in combinatorial optimization
1995
In this short summary of research the paper describes some significant aspects of...
Papers per page: