Zusammenfassung
Es wird ein Branch and Bound-Algorithmus entwickelt, der einen speziellen Typ von sequentiellen kombinatorischen Problemen löst.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literatur
Peter Kolesar: A Branch and Bound Algorithm for the Knapsack-Problem Management Science Vol. 13, No. 9, 1967
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1973 Springer-Verlag Berlin · Heidelberg
About this chapter
Cite this chapter
Kyed, N. (1973). Das Verallgemeinerte Knapsack-Problem. In: Weinberg, F. (eds) Branch and Bound: Eine Einführung. Lecture Notes in Economics and Mathematical Systems, vol 4. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-80724-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-80724-4_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06112-0
Online ISBN: 978-3-642-80724-4
eBook Packages: Springer Book Archive