Publikationen

K. Klamroth,Single-Facility Location Problems with Barriers. Springer Series in Operations Research, 2002.

DOI: 10.1007/b98843

Z. Drezner, K. Klamroth, A. Schöbel and G. O. Wesolowsky, "The Weber problem" in Facility Location: Applications and Theory, Drezner, Z. and Hamacher, H.W., Eds. Springer-Verlag, 2002, pp. 1-36.

Download

K. Klamroth, "A reduction result for location problems with polyhedral barriers", European Journal of Operational Research, vol. 130, pp. 486-497, 2001.

DOI: 10.1016/S0377-2217(99)00399-9

K. Klamroth and M. M. Wiecek, "A time-dependent multiple criteria single-machine scheduling problem", European Journal of Operational Research, vol. 135, pp. 17-26, 2001.

DOI: 10.1016/S0377-2217(00)00286-1

B. Schandl, K. Klamroth and M. M. Wiecek, "Norm-Based Approximation in Bicriteria Programming", Computational Optimization and Applications, vol. 20, no. 1, pp. 23-42, 2001.

DOI: 10.1023/A:1011267305444

B. Schandl, K. Klamroth and M. M. Wiecek, "Norm-based approximation in convex multicriteria programming" in Operations Research Proceedings 2000, Fleischmann, B. and Lasch, R. and Derigs, U. and Domschke, W. and Rieder, U., Eds. Springer-Verlag, 2001, pp. 8-13.

DOI: 10.1007/978-3-642-56656-1_2

K. Klamroth, "Planar location problems with line barriers", Optimization, vol. 49, pp. 517-527, 2001.

DOI: 10.1080/02331930108844547

K. Klamroth and M. M. Wiecek, "Dynamic programming approaches to the multiple criteria knapsack problem", Naval Research Logistics, vol. 47, pp. 57-76, 2000.

DOI: 10.1002/(SICI)1520-6750(200002)47%3A1<57%3A%3AAID-NAV4>3.0.CO%3B2-4

H. W. Hamacher and K. Klamroth, "Planar Weber location problems with barriers and block norms", Annals of Operations Research, vol. 96, pp. 191-208, 2000.

DOI: Planar Weber location problems with barriers and block norms

K. Klamroth and M. M. Wiecek, "Time-dependent capital budgeting with multiple criteria" in Research and Practice in Multiple Criteria Decision Making, Haimes, Y.Y. and Steuer, R.E., Eds. Springer-Verlag, 2000, pp. 421-432.

DOI: 10.1007/978-3-642-57311-8_36

B. Schandl, K. Klamroth and M. M. Wiecek, "Using block norms in bicriteria optimization" in Research and Practice in Multiple Criteria Decision Making, Haimes, Y.Y. and Steuer, R.E., Eds. Springer-Verlag, 2000, pp. 149-160.

DOI: 10.1007/978-3-642-57311-8_12

M. Ehrgott, H. W. Hamacher, K. Klamroth, S. Nickel, A. Schöbel and M. M. Wiecek, "A note on the equivalence of balance points and Pareto solutions in multiple objective programming", Journal of Optimization Theory and Applications, vol. 92, pp. 209-212, 1997.

Download

M. Ehrgott and K. Klamroth, "Connectedness of efficient solutions in multiple criteria combinatorial optimization", European Journal of Operational Research, vol. 97, pp. 159-166, 1997.

DOI: 10.1016/S0377-2217(96)00116-6

M. Ehrgott and K. Klamroth, "Nonconnected efficiency graphs in multiple criteria combinatorial optimization" in Advances in Multiple Objective and Goal Programming, Caballero, R. and Ruiz, F. and Steuer, R.E., Eds. 1997, pp. 140-150.

DOI: 10.1007/978-3-642-46854-4_15

K. Klamroth and I. Mengersen, "The Ramsey number r(K_1,3,C_4,K_4)", Utilitas Mathematica, vol. 52, pp. 65-81, 1997.

EWGLA 8 Proceedings: Special Issue of Studies in Locational Analysis.

K. Klamroth and I. Mengersen, "Ramsey numbers of K_3 versus (p,q)-graphs", Ars Combinatoria, vol. 43, pp. 107-120, 1996.

J. Arste, K. Klamroth and I. Mengersen, "Three color Ramsey numbers for small graphs", Utilitas Mathematica, vol. 49, pp. 85--96, 1996.

Download

M. Heilmann, "Explicit Voronovskaja-type results for linear combinations of BDT-operators", Approximation Theory and its Applications, vol. 11, no. 1, pp. 54-61, 1995.

DOI: 10.1007/BF02836445

M. Heilmann, "Saturation of linear combinations of Baskakov-Durrmeyer-type operators", Applicable Analysis, vol. 59, no. 1-4, pp. 93-107, 1995.

DOI: 10.1080/00036819508840392

K. Klamroth, "Ramsey-Zahlen für Mengen von Graphen", Technical University of Braunschweig, 1994.

M. Heilmann, "Erhöhung der Konvergenzgeschwindigkeit bei der Approximation von Funktionen mit Hilfe von Linearkombinationen spezieller positiver linearer Operatoren", Universität Dortmund, 1992.

Download

M. Heilmann, "Rate of approximation of weighted derivatives by linear combinations of SMD-operators" in Numerical Methods in Approximation Theory - Proceedings of the conference held in Oberwolfach Germany, November 24-30, 1991, D. Braess et al., Eds. Birkhäuser, Basel, Int. Ser. Numer. Math. 105, 1992, pp. 97-115.

DOI: 10.1007/978-3-0348-8619-2_6

M. Heilmann and M. Müller,Equivalence of a weighted modulus of smoothness and a modified weighted K-functional. Academic Press, 1991.

M. Heilmann and M. Müller, "Direct and converse results on simultaneous approximation by the method of Bernstein-Durrmeyer operators" in Algorithms for approximation II, Proc. 2nd Int. Conf., Shrivenham/UK 1988, 1990, pp. 107-116.

DOI: 10.1007/978-1-4899-3442-0_11