Rainer E. Burkard
According to our database1,
Rainer E. Burkard
authored at least 99 papers
between 1970 and 2014.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on id.loc.gov
-
on d-nb.info
On csauthors.net:
Bibliography
2014
2013
Central Eur. J. Oper. Res., 2013
2011
Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees.
Networks, 2011
Math. Methods Oper. Res., 2011
J. Comb. Optim., 2011
Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees.
Discret. Appl. Math., 2011
2010
J. Comb. Optim., 2010
Central Eur. J. Oper. Res., 2010
2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Computing, 2009
2008
2007
Math. Methods Oper. Res., 2007
2006
J. Comb. Optim., 2006
A complex time based construction heuristic for batch scheduling problems in the chemical industry.
Eur. J. Oper. Res., 2006
Central Eur. J. Oper. Res., 2006
2005
Review, extensions and computational comparison of MILP formulations for scheduling of batch processes.
Comput. Chem. Eng., 2005
2004
Eur. J. Oper. Res., 2004
2003
Discret. Appl. Math., 2003
2002
2001
RAIRO Oper. Res., 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
Eur. J. Oper. Res., 2000
1999
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms.
Networks, 1999
Math. Methods Oper. Res., 1999
Proceedings of the Handbook of Combinatorial Optimization, 1999
1998
SIAM Rev., 1998
The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases.
Math. Program., 1998
Inf. Process. Lett., 1998
Computing, 1998
Assignment Problems.
Proceedings of the Fundamentals - Foundations of Computer Science, 1998
1997
Math. Program., 1997
1996
Discret. Appl. Math., 1996
Acta Cybern., 1996
1995
Oper. Res. Lett., 1995
Polynomially Solvable Cases of the Traveling Salesman Problem and a New Exponential Neighborhood.
Computing, 1995
Ann. Oper. Res., 1995
1993
Proceedings of the Quadratic Assignment and Related Problems, 1993
1991
J. Glob. Optim., 1991
Discret. Appl. Math., 1991
1990
1986
1985
Discret. Appl. Math., 1985
1983
Z. Oper. Research, 1983
1982
1981
A Relationship between optimality and efficiency in multicriteria 0-1 programming problems.
Comput. Oper. Res., 1981
1980
1978
Discret. Math., 1978
1977
Math. Methods Oper. Res., 1977
1975
Z. Oper. Research, 1975
Computing, 1975
1970