Solving the maxcut problem by the global equilibrium search

DOI10.1007/s10559-010-9256-4zbMath1305.90356OpenAlexW2145708536MaRDI QIDQ466339

J. Herrera, D. Rodríguez-Gómez

Publication date: 27 October 2014

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

Full work available at URL: https://doi.org/10.1007/s10559-010-9256-4

zbMATH Keywords

cutsetcomputational experimentapproximate methodsglobal equilibrium searchalgorithm efficiency

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (7)

Probabilistic GRASP-tabu search algorithms for the UBQP problem ⋮ Memetic search for the max-bisection problem ⋮ Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel ⋮ The max-out min-in problem: a tool for data analysis ⋮ Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem ⋮ Path relinking for unconstrained binary quadratic programming ⋮ Speeding up a memetic algorithm for the max-bisection problem

Uses Software

• CirCut

Cites Work

• Unnamed Item
• Solving weighted MAX-SAT via global equilibrium search
• The method of global equilibrium search
• Problems of discrete optimization: challenges and main approaches to solve them
• 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
• 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
• Global equilibrium search applied to the unconstrained binary quadratic optimization problem

This page was built for publication: Solving the maxcut problem by the global equilibrium search