Skip to main content
Book Chapter

Combinatorial Optimization via Cross-Entropy

  • Rubinstein R
  • Kroese D
DOI: 10.1007/978-1-4757-4321-0_4
N/ACitations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Rubinstein, R. Y., & Kroese, D. P. (2004). Combinatorial Optimization via Cross-Entropy (pp. 129–186). https://doi.org/10.1007/978-1-4757-4321-0_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free