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

DOI10.1016/J.COR.2007.10.001MaRDI QIDQ954050zbMATHOpenAlexFDO

Authors Manuel Laguna, Abraham Duarte, Rafael Martí

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 optimizationcross-entropymetaheuristicslocal searchmax-cut problem

Mathematics Subject Classification ID

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

Recommendations

• The cross-entropy method for continuous multi-extremal optimization
• A cross entropy based algorithm for reliability problems
• Algorithmes génétiques hybrides pour l'optimisation combinatoire
• On the convergence of the cross-entropy method
• The cross-entropy method for combinatorial and continuous optimization

Cites work

• A Spectral Bundle Method for Semidefinite Programming
• A tutorial on the cross-entropy method
• Application of the cross-entropy method to the buffer allocation problem in a simulation-based environment
• Combinatorial optimization, cross-entropy, ants and rare events
• Cross-entropy and rare events for maximal cut and partition problems
• Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Optimization of computer simulation models with rare events
• Randomized heuristics for the Max-Cut problem
• Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
• Solving the vehicle routing problem with stochastic demands using the cross-entropy method
• The cross-entropy method for combinatorial and continuous optimization

Cited in

(8)

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

Describes a project that uses

Uses Software

• CirCut

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q954050)