Combinatorial Optimization via Cross-Entropy
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.
KeywordsTravel Salesman Problem Partition Problem Quadratic Assignment Problem Trajectory Generation Cost Matrix
Unable to display preview. Download preview PDF.