Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel

DOI10.1007/s10559-015-9692-2zbMath1327.90142OpenAlexW2028432845MaRDI QIDQ895077

Fred Glover, Vladimir P. Shylo, Ivan V. Sergienko

Publication date: 26 November 2015

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: http://dspace.nbuv.gov.ua/handle/123456789/124754

zbMATH Keywords

path relinkingglobal equilibrium searchparallel optimizationteam of algorithmsweighted maximum cut problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Parallel algorithms in computer science (68W10)

Related Items (6)

An effective iterated tabu search for the maximum bisection problem ⋮ Algorithm unions for solving discrete optimization problems ⋮ Kernel technology to solve discrete optimization problems ⋮ A matrix nonconvex relaxation approach to unconstrained binary polynomial programs ⋮ A multiple search operator heuristic for the max-k-cut problem ⋮ Efficient methods to organize the parallel execution of optimization algorithms

Uses Software

• CirCut
• Scatter Search

Cites Work

• Unnamed Item
• Solving the maxcut problem by the global equilibrium search
• On algorithm portfolios and restart strategies
• The method of global equilibrium search
• Problems of discrete optimization: challenges and main approaches to solve them
• A semidefinite programming based polyhedral cut and price approach for the maxcut problem
• 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
• Finding a Maximum Cut of a Planar Graph in Polynomial Time
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Randomized heuristics for the Max-Cut problem
• A Spectral Bundle Method for Semidefinite Programming
• Reducibility among Combinatorial Problems

This page was built for publication: Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel