E-bok
PDF, Engelska, 2006638 kr
Läs direkt efter köp
Bernhard Korte – författare
Visar alla böcker från författaren Bernhard Korte. Handla med fri frakt och snabb leverans.
19 produkter
19 produkter
- E-bokPDF, Engelska, 2007
1 116 kr
Läs direkt efter köp
This comprehensive 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. 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. This third edition contains a new chapter on facility location problems, an area which has been extremely active in the past few years. Furthermore there are several new sections and further material on various topics. New exercises and updates in the bibliography were added. - E-bokPDF, Tyska, 2008
431 kr
Läs direkt efter köp
Dieses umfassende Lehrbuch über kombinatorische Optimierung ist die deutsche Übersetzung der vierten, wesentlich erweiterten Auflage des Buches „Combinatorial Optimization – Theory and Algorithms", dessen erste Auflage im Jahr 2000 erschienen ist. Es ist aus verschiedenen Vorlesungen über kombinatorische Optimierung und Spezialvorlesungen für Fortgeschrittene hervorgegangen, die die Autoren an der Universität Bonn gehalten haben.
Das Buch enthält vornehmlich theoretische Resultate und detaillierte Algorithmen mit beweisbar guten Laufzeiten und Ergebnissen, aber keine Heuristiken. Es werden vollständige Beweise, auch für viele tiefe und neue Resultate gegeben, von denen einige bisher in der Lehrbuchliteratur noch nicht erschienen sind. Ferner enthält das Buch viele Übungsaufgaben und ein umfassendes Literaturverzeichnis. Es gibt den neuesten Stand der kombinatorischen Optimierung wieder.
Aus den Besprechungen der englischen Auflagen:
"This book on combinatorial optimization is a beautiful example of the ideal textbook."
Operations Research Letters 33 (2005), p.216-217
- Häftad, Engelska, 2010
1 131 kr
Skickas inom 5-8 vardagar
This comprehensive 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. 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. This third edition contains a new chapter on facility location problems, an area which has been extremely active in the past few years. Furthermore there are several new sections and further material on various topics. New exercises and updates in the bibliography were added. - E-bokPDF, Engelska, 2012
941 kr
Läs direkt efter köp
This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references.
This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley''s formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.
- E-bokTyska, 2012
359 kr
Läs direkt efter köp
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.
- E-bokPDF, Engelska, 2012
718 kr
Läs direkt efter köp
- Häftad, Engelska, 2012
564 kr
Skickas inom 10-15 vardagar
Oh cieca cupidigia, oh ira folie, Che si ci sproni nella vita corta, E nell' eterna poi si mal c'immolle! o blind greediness and foolish rage, That in our fleeting life so goads us on And plunges us in boiling blood for ever! Dante, The Divine Comedy Inferno, XII, 17, 49/51. On an afternoon hike during the second Oberwolfach conference on Mathematical Programming in January 1981, two of the authors of this book discussed a paper by another two of the authors (Korte and Schrader [1981]) on approximation schemes for optimization problems over independence systems and matroids. They had noticed that in many proofs the hereditary property of independence systems and matroids is not needed: it is not required that every subset of a feasible set is again feasible. A much weaker property is sufficient, namely that every feasible set of cardinality k contains (at least) one feasible subset of cardinality k - 1. We called this property accessibility, and that was the starting point of our investigations on greedoids. - E-bokPDF, Engelska, 2013
1 148 kr
Läs direkt efter köp
Combinatorial optimization is one of the youngest and most active areas of discrete mathematics, and is probably its driving force today. It became a subject in its own right about 50 years ago. This book describes the most important ideas, theoretical results, and algo rithms in combinatorial optimization. We have conceived it as an advanced gradu ate text which can also be used as an up-to-date reference work for current research. The book includes the essential fundamentals of graph theory, linear and integer programming, and complexity theory. It covers classical topics in combinatorial optimization as well as very recent ones. The emphasis is on theoretical results and algorithms with provably good performance. Applications and heuristics are mentioned only occasionally. Combinatorial optimization has its roots in combinatorics, operations research, and theoretical computer science. A main motivation is that thousands of real-life problems can be formulated as abstract combinatorial optimization problems. We focus on the detailed study of classical problems which occur in many different contexts, together with the underlying theory. Most combinatorial optimization problems can be formulated naturally in terms of graphs and as (integer) linear programs. Therefore this book starts, after an introduction, by reviewing basic graph theory and proving those results in linear and integer programming which are most relevant for combinatorial optimization. - E-bokPDF, Engelska, 2013
1 148 kr
Läs direkt efter köp
It was more than a surprise to us that the first edition of this book already went out of print about a year after its first appearance. We were flattered by the many positive and even enthusiastic comments and letters from colleagues and the gen eral readership. Several of our colleagues helped us in finding typographical and other errors. In particular, we thank Ulrich Brenner, Andras Frank, Bernd Gartner and Rolf Mohring. Of course, all errors detected so far have been corrected in this second edition, and references have been updated. Moreover, the first preface had a flaw. We listed all individuals who helped us in preparing this book. But we forgot to mention the institutional support, for which we make amends here. It is evident that a book project which took seven years benefited from many different grants. We would like to mention explicitly the bilateral Hungarian German Research Project, sponsored by the Hungarian Academy of Sciences and the Deutsche Forschungsgemeinschaft, two Sonderforschungsbereiche (special re search units) of the Deutsche Forschungsgemeinschaft, the Ministere Franc;ais de la Recherche et de la Technologie and the Alexander von Humboldt Foundation for support via the Prix Alexandre de Humboldt, and the Commission of the Eu ropean Communities for participation in two projects DONET. Our most sincere thanks go to the Union of the German Academies of Sciences and Humanities and to the Northrhine-Westphalian Academy of Sciences. - Del 21 - Algorithms and Combinatorics
Combinatorial Optimization
Theory and Algorithms
Inbunden, Engelska, 20181 122 kr
Skickas inom 10-15 vardagar
This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+ɛ)-approximation for Steiner trees, and the VPN theorem. Thus, this book continues torepresent the state of the art of combinatorial optimization. - E-bokEngelska, 2018
957 kr
Läs direkt efter köp
This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references.
This sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+ɛ)-approximation for Steiner trees, and the VPN theorem. Thus, this book continues torepresent the state of the art of combinatorial optimization.
- Häftad, Tyska, 2018
528 kr
Skickas inom 10-15 vardagar
Dieses umfassende Lehrbuch über Kombinatorische Optimierung ist die deutsche Übersetzung der sechsten 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 dritte deutsche Auflage wurde entsprechend der sechsten englischen Auflage aktualisiert, überarbeitet und ergänzt. Es gibt unter anderem neue Abschnitte zu seichten leichten Bäumen, der Maximierung submodularer Funktionen, geglätteter Analyse vom Knapsack-Problem, der (ln 4 + ɛ)-Approximation von Steinerbäumen und dem VPN Problem.Aus Besprechungen der englischen Auflagen:"This book on combinatorial optimization is a beautiful example of the ideal textbook." Operations Research Letters 33 (2005), p.216-217"… this very recommendable book documents the relevant knowledge on combinatorial optimization and records those problems and algorithms that define this discipline today. To read this is very stimulating for all the researchers, practitioners, and students interested in combinatorial optimization." OR News 19 (2003), p.42"...gives an excellent comprehensive view of the exciting field of combinatorial optimization." Zentralblatt MATH 1149.90126 - E-bokPDF, Tyska, 2018
510 kr
Läs direkt efter köp
Dieses umfassende Lehrbuch über Kombinatorische Optimierung ist die deutsche Übersetzung der sechsten 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 dritte deutsche Auflage wurde entsprechend der sechsten englischen Auflage aktualisiert, überarbeitet und ergänzt. Es gibt unter anderem neue Abschnitte zu seichten leichten Bäumen, der Maximierung submodularer Funktionen, geglätteter Analyse vom Knapsack-Problem, der (ln 4 + ɛ)-Approximation von Steinerbäumen und dem VPN Problem.
Aus Besprechungen der englischen Auflagen:"This book on combinatorial optimization is a beautiful example of the ideal textbook." Operations Research Letters 33 (2005), p.216-217"… this very recommendable book documents the relevant knowledge on combinatorial optimization and records those problems and algorithms that define this discipline today. To read this is very stimulating for all the researchers, practitioners, and students interested in combinatorial optimization." OR News 19 (2003), p.42"...gives an excellent comprehensive view of the exciting field of combinatorial optimization." Zentralblatt MATH 1149.90126
- Del 21 - Algorithms and Combinatorics
Combinatorial Optimization
Theory and Algorithms
Häftad, Engelska, 2019787 kr
Skickas inom 10-15 vardagar
This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+ɛ)-approximation for Steiner trees, and the VPN theorem. Thus, this book continues torepresent the state of the art of combinatorial optimization. - Del 2001 - Forschungsberichte des Landes Nordrhein-Westfalen
Ein univariables ökonomisches Analyse- und Prognosemodell
Häftad, Tyska, 1968597 kr
Skickas inom 10-15 vardagar
- E-bokPDF, Tyska, 2013
591 kr
Läs direkt efter köp
- Häftad, Italienska, 2011
543 kr
Skickas inom 10-15 vardagar
Questo libro di testo di ottimizzazione combinatoria pone in particolare risalto irisultati teorici e gli algoritmi che, al contrario delle euristiche, hanno una garanziadi avere buone prestazioni. Comprende una vasta scelta di argomenti e nascecome riferimento di diversi corsi di ottimizzazione combinatoria sia di base che dilivello avanzato. Il libro contiene dimostrazioni complete (ma concise) anchedi molti risultati avanzati, alcuni dei quali non sono mai apparsi prima in un libro.Vengono anche trattati molti dei temi di ricerca più attuali e sono riportati moltiriferimenti alla letteratura. Quindi questo libro, traduzione della quarta edizione in lingua originale, rappresenta lo stato dell’arte dell’ottimizzazione combinatoria. - E-bokPDF, Italienska, 2011
558 kr
Läs direkt efter köp
Questo libro di testo di ottimizzazione combinatoria pone in particolare risalto i
risultati teorici e gli algoritmi che, al contrario delle euristiche, hanno una garanzia
di avere buone prestazioni. Comprende una vasta scelta di argomenti e nasce
come riferimento di diversi corsi di ottimizzazione combinatoria sia di base che di
livello avanzato. Il libro contiene dimostrazioni complete (ma concise) anche
di molti risultati avanzati, alcuni dei quali non sono mai apparsi prima in un libro.
Vengono anche trattati molti dei temi di ricerca più attuali e sono riportati molti
riferimenti alla letteratura. Quindi questo libro, traduzione della quarta edizione in lingua originale, rappresenta lo stato dell’arte dell’ottimizzazione combinatoria.
