A VNS metaheuristic with stochastic steps for Max 3-cut and Max 3-section
From MaRDI portal
Publication:1954820
DOI10.1155/2012/475018zbMath1264.90172WikidataQ58911746 ScholiaQ58911746MaRDI QIDQ1954820
Publication date: 11 June 2013
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/475018
90C35: Programming involving graphs or networks
90C59: Approximation methods and heuristics in mathematical programming
Uses Software
Cites Work
- The capacitated max \(k\)-cut problem
- Variable neighbourhood search: methods and applications
- Some simplified NP-complete graph problems
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
- Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- Variable neighborhood search for the p-median
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Complex Quadratic Optimization and Semidefinite Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item