Applications of cut polyhedra—I
Journal of Computational and Applied Mathematics
Ejection chains, reference structures and alternating path methods for traveling salesman problems
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
A Spectral Bundle Method for Semidefinite Programming
SIAM Journal on Optimization
On greedy construction heuristics for the MAX-CUT problem
International Journal of Computational Science and Engineering
Advanced Scatter Search for the Max-Cut Problem
INFORMS Journal on Computing
Using landscape measures for the online tuning of heterogeneous distributed gas
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Breakout Local Search for the Max-Cutproblem
Engineering Applications of Artificial Intelligence
Real-time classification via sparse representation in acoustic sensor networks
Proceedings of the 11th ACM Conference on Embedded Networked Sensor Systems
| Hi-index | 0.00 |
The Max-Cut problem consists of partitioning the nodes of an undirected weighted graph into two subsets, such that the sum of the weights of the edges that connect two vertices in different partitions is maximized. It has applications in several fields like statistical physics, VLSI design, among others, and is known to be NP-Hard. We propose a Neighborhood generation method that balances diversity and quality of the obtained solutions. Consequently, the inclusion within Simulated Annealing and Tabu Search frameworks produces similar results to those reported by state-of-the-art methods such as VNSPR and Scatter Search, and in some cases improves them.