A low-level hybridization between memetic algorithm and VNS for the max-cut problem
- 25 June 2005
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- A Hierarchical Social Metaheuristic for the Max-Cut ProblemLecture Notes in Computer Science, 2004
- Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic ProgramsSIAM Journal on Optimization, 2002
- Randomized heuristics for the Max-Cut problemOptimization Methods and Software, 2002
- A Spectral Bundle Method for Semidefinite ProgrammingSIAM Journal on Optimization, 2000
- Variable neighborhood searchComputers & Operations Research, 1997
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- Efficient Algorithms for Layer Assignment ProblemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- P-Complete Approximation ProblemsJournal of the ACM, 1976
- Finding a Maximum Cut of a Planar Graph in Polynomial TimeSIAM Journal on Computing, 1975
- Reducibility among Combinatorial ProblemsPublished by Springer Science and Business Media LLC ,1972