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

DOI10.1007/S10559-015-9692-2MaRDI QIDQ895077zbMATHOpenAlexFDO

Authors Fred Glover, V. P. Shylo, I. 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)

Recommendations

• An approximate algorithm for the solution of the problem of finding the maximum weighted cut of a graph
• Efficient methods to organize the parallel execution of optimization algorithms
• Solving the maxcut problem by the global equilibrium search
• Solving weighted MAX-SAT via global equilibrium search
• scientific article; zbMATH DE number 1150245

Cites work

• A Spectral Bundle Method for Semidefinite Programming
• A semidefinite programming based polyhedral cut and price approach for the maxcut problem
• 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
• Fundamentals of scatter search and path relinking
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• On algorithm portfolios and restart strategies
• Problems of discrete optimization: challenges and main approaches to solve them
• Randomized heuristics for the Max-Cut problem
• Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
• Reducibility among combinatorial problems
• Solving the maxcut problem by the global equilibrium search
• The method of global equilibrium search

Cited in

(6)

• Efficient methods to organize the parallel execution of optimization algorithms
• Algorithm unions for solving discrete optimization problems
• An effective iterated tabu search for the maximum bisection problem
• 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

Describes a project that uses

Uses Software

• CirCut
• Scatter Search

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q895077)