Zusammenhang Zwischen Dynamischer Programmierung und Branch & Bound

Kall, P.

doi:10.1007/978-3-662-00234-6_6

P. Kall

Part of the book series: Lecture Notes in Operations Research and Mathematical Economics ((LNE,volume 4))

44 Accesses

Zusammenfassung

Die Problemstellung der diskreten dynamischen Programmierung soll zunächst an einem Beispiel erläutert werden.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Chapter: USD 29.95; Price excludes VAT (USA)

eBook: USD 54.99; Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Authors

P. Kall
View author publications
You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

Instituts für Operations Reseach, ETH, Zürich, Schweiz
F. Weinberg

Rights and permissions

Reprints and permissions

Copyright information

About this chapter

Cite this chapter

Kall, P. (1968). Zusammenhang Zwischen Dynamischer Programmierung und Branch & Bound. In: Weinberg, F. (eds) Einführung in die Methode Branch and Bound. Lecture Notes in Operations Research and Mathematical Economics, vol 4. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-00234-6_6

Download citation

DOI: https://doi.org/10.1007/978-3-662-00234-6_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-04253-2
Online ISBN: 978-3-662-00234-6
eBook Packages: Springer Book Archive

Publish with us

Policies and ethics