A multiple search operator heuristic for the max-k-cut problem
From MaRDI portal
Publication:513573
DOI10.1007/s10479-016-2234-0zbMath1357.90122arXiv1510.09156OpenAlexW2242324393MaRDI QIDQ513573
Publication date: 7 March 2017
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.09156
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (5)
Computational study of valid inequalities for the maximum \(k\)-cut problem ⋮ Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints ⋮ Computational study of a branching algorithm for the maximum \(k\)-cut problem ⋮ Efficient enumeration of the optimal solutions to the correlation clustering problem ⋮ Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- Memetic search for the max-bisection problem
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
- Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- A discrete dynamic convexized method for the max-cut problem
- Speeding up a memetic algorithm for the max-bisection problem
- A projected gradient algorithm for solving the maxcut SDP relaxation
- Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
- Advanced Scatter Search for the Max-Cut Problem
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- Randomized heuristics for the Max-Cut problem
- Realignment in the National Football League: Did they do it right?
- Fast approximation algorithms on maxcut, k-coloring, and k-color ordering for VLSI applications
- A graph-theoretic via minimization algorithm for two-layer printed circuit boards
- An Efficient Memetic Algorithm for theMax-Bisection Problem
This page was built for publication: A multiple search operator heuristic for the max-k-cut problem