Hybridizing the cross-entropy method: An application to the max-cut problem
From MaRDI portal
Publication:954050
DOI10.1016/J.COR.2007.10.001zbMATH Open1157.90508OpenAlexW2166283570MaRDI QIDQ954050FDOQ954050
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
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
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
- A Spectral Bundle Method for Semidefinite Programming
- Optimization of computer simulation models with rare events
- The cross-entropy method for combinatorial and continuous optimization
- A tutorial on the cross-entropy method
- Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
- Cross-entropy and rare events for maximal cut and partition problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Solving the vehicle routing problem with stochastic demands using the cross-entropy method
- Application of the cross-entropy method to the buffer allocation problem in a simulation-based environment
- Randomized heuristics for the Max-Cut problem
- Combinatorial optimization, cross-entropy, ants and rare events
Cited In (8)
- Cross entropy for multiobjective combinatorial optimization problems with linear relaxations
- Black box scatter search for general classes of binary optimization problems
- Minimising maximum response time
- A black-box scatter search for optimization problems with integer variables
- A cross entropy approach to design of reliable networks
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem
- 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
Uses Software
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)
