Advanced scatter search for the max-cut problem

DOI10.1287/IJOC.1080.0275MaRDI QIDQ2901043zbMATH OpenOpenAlexFDO

Authors Rafael Martí, Abraham Duarte, Manuel Laguna

Publication date 28 July 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.1080.0275

zbMATH Keywords

metaheuristicsevolutionary algorithmsscatter searchmax-cut problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Scatter search for the cutwidth minimization problem
• scientific article; zbMATH DE number 6500694
• A scatter search algorithm for the maximum clique problem
• Computational approaches to MAX-cut
• scientific article; zbMATH DE number 5232308
• A novel formulation of the max-cut problem and related algorithm
• New approximation results for the maximum scatter TSP
• A multiple search operator heuristic for the max-k-cut problem
• A continuation algorithm for max-cut problem

Cited in

(28)

• Scatter search with stochastic beam search on the coalition formation problem
• A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location
• Scatter search for the cutwidth minimization problem
• Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables
• Solving combinatorial optimisation problems using oscillator based Ising machines
• What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
• Exponential extrapolation memory for tabu search
• Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
• Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel
• A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection
• Randomized heuristics for the Max-Cut problem
• A new global algorithm for max-cut problem with chordal sparsity
• An effective iterated tabu search for the maximum bisection problem
• Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem
• Probabilistic GRASP-tabu search algorithms for the UBQP problem
• scientific article; zbMATH DE number 6500694 (Why is no real title available?)
• Speeding up a memetic algorithm for the max-bisection problem
• Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs
• A multiple search operator heuristic for the max-k-cut problem
• Solving the edge‐disjoint paths problem using a two‐stage method
• Black box scatter search for general classes of binary optimization problems
• Scatter search for the bandpass problem
• Path relinking for unconstrained binary quadratic programming
• Solving the maxcut problem by the global equilibrium search
• Memetic search for the max-bisection problem
• A memetic algorithm for the max-cut problem
• Hybrid evolutionary search for the traveling repairman problem with profits
• A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints

Describes a project that uses

Uses Software

• GRASP

This page was built for publication: Advanced scatter search for the max-cut problem

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