Abstract
In this chapter we show how the CE method can be easily transformed into an efficient and versatile randomized algorithm for solving optimization problems, in particular combinatorial optimization problems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Science+Business Media New York
About this chapter
Cite this chapter
Rubinstein, R.Y., Kroese, D.P. (2004). Combinatorial Optimization via Cross-Entropy. In: The Cross-Entropy Method. Information Science and Statistics. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-4321-0_4
Download citation
DOI: https://doi.org/10.1007/978-1-4757-4321-0_4
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-1940-3
Online ISBN: 978-1-4757-4321-0
eBook Packages: Springer Book Archive