According to our database
1,
Rainer E. Burkard
authored at least 99 papers
between 1970 and 2014.
Collaborative distances:
2014
Bounds on the radius and status of graphs.
Networks, 2014
2013
A linear time algorithm for inverse obnoxious center location problems on networks.
Central Eur. J. Oper. Res., 2013
2011
Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees.
Networks, 2011
Inverse <i>p</i>-median problems with variable edge lengths.
Math. Methods Oper. Res., 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.
Discret. Appl. Math., 2011
2010
Median problems with positive and negative weights on cycles and cacti.
J. Comb. Optim., 2010
The inverse Fermat-Weber problem.
Eur. J. Oper. Res., 2010
Inverse center location problems.
Electron. Notes Discret. Math., 2010
Inverse median location problems with variable coordinates.
Central Eur. J. Oper. Res., 2010
2009
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
SIAM, ISBN: 978-0-89871-663-4, 2009
2008
The inverse 1-median problem on a cycle.
Discret. Optim., 2008
Reverse 2-median problem on trees.
Discret. Appl. Math., 2008
2007
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. Methods Oper. Res., 2007
Monge properties, discrete convexity and applications.
Eur. J. Oper. Res., 2007
Discrete optimization: An Austrian view.
Ann. Oper. Res., 2007
2006
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.
Eur. J. Oper. Res., 2006
An ant colony algorithm for the pos/neg weighted <i>p</i>-median problem.
Central Eur. J. Oper. Res., 2006
2005
Math. Methods Oper. Res., 2005
Review, extensions and computational comparison of MILP formulations for scheduling of batch processes.
Comput. Chem. Eng., 2005
2004
On the Euclidean TSP with a permuted Van der Veen matrix.
Inf. Process. Lett., 2004
Weight reduction problems with certain bottleneck objectives.
Eur. J. Oper. Res., 2004
2003
Constrained Steiner trees in Halin graphs.
RAIRO Oper. Res., 2003
Max algebra and the linear assignment problem.
Math. Program., 2003
Center problems with pos/neg weights on trees.
Eur. J. Oper. Res., 2003
Finding all essential terms of a characteristic maxpolynomial.
Discret. Appl. Math., 2003
2002
Selected topics on assignment problems.
Discret. Appl. Math., 2002
A Note on the Robust 1-Center Problem on Trees.
Ann. Oper. Res., 2002
2001
The Obnoxious Center Problem on a Tree.
SIAM J. Discret. Math., 2001
Bottleneck Capacity Expansion Problems with General Budget Constraints.
RAIRO Oper. Res., 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. Glob. Optim., 2001
2000
Recent advances in theory and practice of combinatorial optimization (ECCO X).
Eur. J. Oper. Res., 2000
2-Medians in trees with pos/neg weights.
Discret. Appl. Math., 2000
1999
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. Methods Oper. Res., 1999
Volume Maximization and Orthoconvex Approximation of Orthogons.
Computing, 1999
Linear Assignment Problems and Extensions.
Proceedings of the Handbook of Combinatorial Optimization, 1999
1998
Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey.
SIAM Rev., 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.
Ann. Oper. Res., 1998
Proceedings of the Fundamentals - Foundations of Computer Science, 1998
1997
Efficiently solvable special cases of hard combinatorial optimization problems.
Math. Program., 1997
QAPLIB - A Quadratic Assignment Problem Library.
J. Glob. Optim., 1997
Hamiltonian cycles in circulant digraphs with two stripes.
Discret. Math., 1997
Bounded Space On-Line Variable-Sized Bin Packing.
Acta Cybern., 1997
1996
Cut and patch Steiner trees for ladders.
Discret. Math., 1996
Three-dimensional Axial Assignment Problems with Decomposable Cost Coefficients.
Discret. Appl. Math., 1996
Perspectives of Monge Properties in Optimization.
Discret. Appl. Math., 1996
Steiner Minimum Trees for Equidistant Points on Two Sides of an Angle.
Acta Cybern., 1996
1995
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
Vehicle routing in an automated warehouse: Analysis and optimization.
Ann. Oper. Res., 1995
1993
The quickest flow problem.
ZOR Methods Model. Oper. Res., 1993
Erratum: Constrained Partitioning Problems.
Discret. Appl. Math., 1993
On the Biquadratic Assignment Problem.
Proceedings of the Quadratic Assignment and Related Problems, 1993
1991
Lexicographic bottleneck problems.
Oper. Res. Lett., 1991
ZOR Methods Model. Oper. Res., 1991
Mathematical programs with a two-dimensional reverse convex constraint.
J. Glob. Optim., 1991
Efficiently solvable special cases of bottleneck travelling salesman problems.
Discret. Appl. Math., 1991
1990
ZOR Methods Model. Oper. Res., 1990
Constrained partitioning problems.
Discret. Appl. Math., 1990
Shortest polygonal paths in space.
Computing, 1990
1986
On latin squares and the facial structure of related polytopes.
Discret. Math., 1986
Optimal schedules for periodically recurring events.
Discret. Appl. Math., 1986
1985
Probabilistic asymptotic properties of some combinatorial optimization problems.
Discret. Appl. Math., 1985
Time-slot assignment for TDMA-systems.
Computing, 1985
1983
The asymptotic probabilistic behaviour of quadratic sum assignment problems.
Z. Oper. Research, 1983
1982
On random quadratic bottleneck assignment problems.
Math. Program., 1982
On abstract duality in mathematical programming.
Z. Oper. Research, 1982
1981
A Relationship between optimality and efficiency in multicriteria 0-1 programming problems.
Comput. Oper. Res., 1981
1980
A note on Hamiltonian split graphs.
J. Comb. Theory, Ser. B, 1980
1978
,
,
,
,
,
,
,
,
,
,
Z. Oper. Research, 1978
A general Hungarian method for the algebraic transportation problem.
Discret. Math., 1978
1977
An algebraic approach to assignment problems.
Math. Program., 1977
Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme.
Math. Methods Oper. Res., 1977
1975
Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme.
Z. Oper. Research, 1975
Algorithmus 25 Verfahren zur gemischt-ganzzahligen, konvexen Optimierung.
Computing, 1975
1970
Untersuchungen zum Optimum-Mix Problem.
Unternehmensforschung, 1970
