Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel
DOI10.1007/S10559-015-9692-2zbMATH Open1327.90142OpenAlexW2028432845MaRDI QIDQ895077FDOQ895077
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
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
path relinkingglobal equilibrium searchparallel optimizationteam of algorithmsweighted maximum cut problem
Cites Work
- Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
- A Spectral Bundle Method for Semidefinite Programming
- Reducibility among Combinatorial Problems
- Fundamentals of scatter search and path relinking
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem
- Advanced scatter search for the max-cut problem
- Randomized heuristics for the Max-Cut problem
- Solving the maxcut problem by the global equilibrium search
- Finding a Maximum Cut of a Planar Graph in Polynomial Time
- The method of global equilibrium search
- Problems of discrete optimization: challenges and main approaches to solve them
- On algorithm portfolios and restart strategies
Cited In (6)
- An effective iterated tabu search for the maximum bisection problem
- Efficient methods to organize the parallel execution of optimization algorithms
- 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
- Algorithm unions for solving discrete optimization problems
Uses Software
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)
