WorldCat Identities

Korte, B. H. (Bernhard H.) 1938-

Overview
Works: 127 works in 615 publications in 6 languages and 7,680 library holdings
Genres: Conference papers and proceedings  History  Art 
Roles: Author, Editor, Translator, Other, Honoree, Contributor
Classifications: QA402.5, 519.7
Publication Timeline
.
Most widely held works about B. H Korte
 
Most widely held works by B. H Korte
Combinatorial optimization : theory and algorithms by B. H Korte( Book )

130 editions published between 2000 and 2014 in 5 languages and held by 1,108 WorldCat member libraries worldwide

"This textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. Since the complete book contains enough material for at least four semesters (4 hours a week), one usually selects material in a suitable way. The book contains complete (but concise) proofs, also for many deep results, some of which did not appear in a book before. Many very recent topics are covered as well, and many references are provided. Thus this book represents the state-of-the-art of combinatorial optimization. For the second edition several corrections and many updates have been made in the text."--Jacket
Mathematical programming : the state of the art, Bonn 1982 by Achim Bachem( Book )

29 editions published between 1983 and 1984 in 3 languages and held by 558 WorldCat member libraries worldwide

About the XIth International Symposium on Mathematical Programming; Mathematical programming: the state of the Art - Bonn 1982; Scientific program
Mathematical programming at Oberwolfach by B. H Korte( Book )

34 editions published between 1981 and 1984 in 3 languages and held by 515 WorldCat member libraries worldwide

Optimization and operations research : proceedings of a conference held at Oberwolfach, July 27-August 2, 1975 by Rudolf Henn( Book )

20 editions published between 1977 and 1978 in English and German and held by 282 WorldCat member libraries worldwide

This volume constitutes the proceedings of the workshop "Optimierung und Operations Research", held at the Elly Holterhoff Backing Stift (Bad Honnef) of the University of Bonn, October 2-8, 1977. This conference was devoted to recent advances in the field of mathe matical programming, optimization techniques, and operations research. It was attended by about 50 invited participants. Furthermore many scholars in these areas showed a great interest in this workshop, despite several other conferences and activities on similar topics in the year 1977. The organizers regret that considerations of avail able space for conference activities limited the number of participants. This widespread interest, the high quality of the lectures presented and the active and stimulating discussions at the conference mani fested the breadth of the activity ongoing in the field covered by this workshop and the necessity that this field be cultivated to a greater extent by the scientific community. The workshop was organized by the Institute of Operations Research (Sonderforschungsbereich 21), University of Bonn and was generously sponsored by the Gesellschaft der Freunde und Forderer der Rheinischen Friedrich-Wilhelms-Universitat and by IBM Germany. Only through this invaluable support was this workshop possible; for this the editors wish to express their sincere thanks and appreciation. Bonn, December 1977 R. Henn B. Korte W. Oettli III TABLE OF CONTENTS A. Bachem The theorem of Minkowski for polyhedral monoids and aggregated linear diophantine systems • • • . • • • • • • • S. Baum and L.E. Trotter, Jr
Greedoids by B. H Korte( Book )

19 editions published between 1991 and 2013 in English and held by 264 WorldCat member libraries worldwide

With the advent of computers, algorithmic principles play an ever increasing role in mathematics. Algorithms have to exploit the structure of the underlying mathematical object, and properties exploited by algorithms are often closely tied to classical structural analysis in mathematics. This connection between algorithms and structure is in particular apparent in discrete mathematics, where proofs are often constructive, and can be turned into algorithms more directly. The principle of greediness plays a fundamental role both in the design of continuous algorithms (where it is called the steepest descent or gradient method) and of discrete algorithms. The discrete structure most closely related to greediness is a matroid; in fact, matroids may be characterized axiomatically as those independence systems for which the greedy solution is optimal for certain optimization problems (e.g. linear objective functions, bottleneck functions). This book is an attempt to unify different approaches and to lead the reader from fundamental results in matroid theory to the current borderline of open research problems. The monograph begins by reviewing classical concepts from matroid theory and extending them to greedoids. It then proceeds to the discussion of subclasses like interval greedoids, antimatroids or convex geometries, greedoids on partially ordered sets and greedoid intersections. Emphasis is placed on optimization problems in greedois. An algorithmic characterization of greedoids in terms of the greedy algorithm is derived, the behaviour with respect to linear functions is investigated, the shortest path problem for graphs is extended to a class of greedoids, linear descriptions of antimatroid polyhedra and complexity results are given and the Rado-Hall theorem on transversals is generalized. The self-contained volume which assumes only a basic familarity with combinatorial optimization ends with a chapter on topological results in connection with greedoids
Paths, flows, and VLSI-layout by B. H Korte( Book )

15 editions published between 1988 and 1990 in English and German and held by 252 WorldCat member libraries worldwide

Bonn Workshop on Combinatorial Optimization by 1980, Bonn) Workshop on Combinatorial Optimization (4( Book )

20 editions published in 1982 in English and held by 230 WorldCat member libraries worldwide

Bonn Workshop on Combinatorial Optimization
Kombinatorische Optimierung : Theorie und Algorithmen by B. H Korte( Book )

8 editions published between 2008 and 2012 in German and English and held by 99 WorldCat member libraries worldwide

Das umfassende Lehrbuch zur Kombinatorischen Optimierung beruht auf Vorlesungen, die die Autoren an der Universität Bonn gehalten haben. Sie geben den neuesten Stand des Fachgebiets wieder mit Schwerpunkt auf theoretischen Resultaten und Algorithmen mit guten Laufzeiten und Ergebnissen. Der Band enthält vollständige Beweise, einige davon wurden bisher nicht in der Lehrbuchliteratur publiziert. Die deutschsprachige Neuauflage enthält alle Ergänzungen und Aktualisierungen der 5. englischsprachigen Auflage, darunter mehr als 60 neue Übungsaufgaben. Dieses umfassende Lehrbuch über Kombinatorische Optimierung ist die deutsche Übersetzung der fünften Auflage des Buches Combinatorial Optimization Theory and Algorithms". Es ist aus verschiedenen Vorlesungen unterschiedlichen Niveaus (angefangen im 3. Semester des Bachelorstudiengangs) hervorgegangen, die die Autoren an der Universität Bonn gehalten haben. Das Buch legt den Schwerpunkt auf theoretische Resultate und Algorithmen mit beweisbar guten Laufzeiten und Ergebnissen. Es werden vollständige Beweise, auch für viele tiefe und neue Sätze gegeben, von denen einige bisher in der Lehrbuchliteratur noch nicht erschienen sind. Ferner enthält das Buch zahlreiche Übungsaufgaben und umfassende Literaturangaben. Diese zweite deutsche Auflage enthält alle Ergänzungen und Aktualisierungen der fünften englischen Auflage, darunter mehr als 60 neue Übungsaufgaben. Sie gibt den neuesten Stand der Kombinatorischen Optimierung wieder
Mathematik, Realität und Ästhetik : eine Bilderfolge zum VLSI chip design = Mathematics, reality, and aesthetics : a picture set on VLSI chip design by Universität Bonn( Book )

7 editions published in 1991 in 3 languages and held by 79 WorldCat member libraries worldwide

Beiträge zur Theorie der Hardy'schen Funktionenklassen by B. H Korte( Book )

10 editions published between 1967 and 1968 in German and Undetermined and held by 62 WorldCat member libraries worldwide

Ein univariables ökonomisches Analyse- und Prognosemodell by B. H Korte( Book )

8 editions published in 1968 in German and Undetermined and held by 60 WorldCat member libraries worldwide

Die vorliegende Arbeit ist ein in sich abgeschlossenes Teilergebnis eines von mir geleiteten Forschungsvorhabens, das die {raquo}Untersuchung und Analyse der wirtschaft lichen Entwicklungsproblematik mit dem Ziel einer Erweiterung der Einsicht in die Grundsatze und Richtlinien fur die praktische Wirtschafts- und Finanzpolitik{laquo} zum Gegenstand hat. Diese Arbeit setzt in speziell mathematischer Ausrichtung meine Untersuchungen uber das Konjunkturphiinomen (siehe hierzu insbesondere M.E. KAMP, D. SMOLINSKI und H.]. WILD, Untersuchungen zur endogenen ProzeBsystematik der marktwirtschaft lichen Entwicklung im 20. Jahrhundert, Stuttgart 1964) fort, wobei die bisherigen Resultate mir den Mut gaben, auf der Basis der dort gewonnenen Erkenntnisse der okonomischen Phanornenzusammenhange, ein Prognosernodell entwickeln zu lassen. Hierbei handelt es sich urn ein sogenanntes univariables Modell, das irn Gegensatz zu den okonomischen Globalrnodellen zur Analyse und Prognose explizit keine weiteren okonomischen Variablen benutzt. Es wird vielrnehr die V orhersage der Entwicklung okonomischer GroBen aus den analytisch festgestellten GesetzmaBigkeiten in den Bewegungsablaufen der Vergangenheit vorgenommen. Ober die mit einem solchen Ansatz zu erreichende Prognosegute gibt das umfangreiche Zahlenmaterial, welches von den Verfassern in Kapitel 6 zusammengestellt wurde, einen ausfiihrlichen Einblick. Das hier dargestellte Verfahren kann und soll unmittelbar keinen Beitrag zur okonorni schen Theorienbildung leisten. Es solI nur, von dem ausgehend, was als okonomische Entwicklung begrifflich und tatsachlich vorliegt, eine exakte instrurnentelle Grundlage sein, von der her bestehende Hypothesen zur okonomischen Entwicklungsproblernatik bestatigt oder falsifiziert oder gar ncu konzipiert werden konnen
Die Rechenmaschine von Johann Christoph Schuster 1820/22 by B. H Korte( Book )

3 editions published in 2004 in German and held by 47 WorldCat member libraries worldwide

Mathematical Programming at Oberwolfach by Helmut König( )

1 edition published in 1981 in English and held by 27 WorldCat member libraries worldwide

The intersection of matroids and antimatroids by B. H Korte( Book )

6 editions published between 1986 and 1989 in German and English and held by 11 WorldCat member libraries worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.68 (from 0.50 for Research t ... to 0.95 for The inters ...)

Combinatorial optimization : theory and algorithms
Alternative Names
Bernhard Korte deutscher Mathematiker, Informatiker und Ökonom

Bernhard Korte Duits wiskundige

Bernhard Korte German mathematician

Bernhard Korte német matematikus, 1938-

Bernhard Korte tysk datavetare och matematiker

Bernhard Korte tysk informatikar og matematikar

Bernhard Korte tysk informatiker og matematiker

Korte, B.

Korte, B. 1938-

Korte, B. (Bernhard)

Korte, B. (Bernhard), 1938-

Korte, B. H.

Korte, B.H. 1938-

Korte, B. H. (Bernhard H.)

Korte, B. H. (Bernhard H.), 1938-

Korte, Bernhard.

Korte, Bernhard 1938-...

Korte, Bernhard H. 1938-

コルテ, B

Languages
English (293)

German (61)

French (15)

Italian (10)

Japanese (7)

Dutch (3)

Covers
Discrete optimization : proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium, co-sponsored by IBM Canada and SIAM, Banff, Alta. and Vancouver, B.C., Canada, August 1977Bonn Workshop on Combinatorial OptimizationKombinatorische Optimierung : Theorie und Algorithmen