Hybridizing the cross-entropy method: An application to the max-cut problem

DOI10.1016/J.COR.2007.10.001zbMath1157.90508OpenAlexW2166283570MaRDI QIDQ954050

Rafael Martí, Manuel Laguna, Abraham Duarte

Publication date: 7 November 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2007.10.001

zbMATH Keywords

combinatorial optimizationmetaheuristicslocal searchcross-entropymax-cut problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (8)

Cross entropy for multiobjective combinatorial optimization problems with linear relaxations ⋮ Minimising maximum response time ⋮ Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences ⋮ Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness ⋮ Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem ⋮ Black box scatter search for general classes of binary optimization problems ⋮ A black-box scatter search for optimization problems with integer variables ⋮ A cross entropy approach to design of reliable networks

Uses Software

• CirCut

Cites Work

• Unnamed Item
• Optimization of computer simulation models with rare events
• The cross-entropy method for combinatorial and continuous optimization
• A tutorial on the cross-entropy method
• Application of the cross-entropy method to the buffer allocation problem in a simulation-based environment
• Solving the vehicle routing problem with stochastic demands using the cross-entropy method
• Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
• Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Randomized heuristics for the Max-Cut problem
• A Spectral Bundle Method for Semidefinite Programming
• Cross-entropy and rare events for maximal cut and partition problems

This page was built for publication: Hybridizing the cross-entropy method: An application to the max-cut problem