Advertisement

Combinatorial Optimization via Cross-Entropy

  • Reuven Y. Rubinstein
  • Dirk P. Kroese
Part of the Information Science and Statistics book series (ISS)

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.

Keywords

Travel Salesman Problem Partition Problem Quadratic Assignment Problem Trajectory Generation Cost Matrix 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2004

Authors and Affiliations

  • Reuven Y. Rubinstein
    • 1
  • Dirk P. Kroese
    • 2
  1. 1.Department of Industrial Engineering and ManagementTechnionTechnion City, HaifaIsrael
  2. 2.Department of MathematicsUniversity of QueenslandBrisbaneAustralia

Personalised recommendations