Advanced Scatter Search for the Max-Cut Problem
From MaRDI portal
Publication:2901043
DOI10.1287/ijoc.1080.0275zbMath1243.90227OpenAlexW1976523866MaRDI QIDQ2901043
Manuel Laguna, Abraham Duarte, Rafael Martí
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
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables, Probabilistic GRASP-tabu search algorithms for the UBQP problem, An effective iterated tabu search for the maximum bisection problem, A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection, Memetic search for the max-bisection problem, Solving the edge‐disjoint paths problem using a two‐stage method, Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel, Solving combinatorial optimisation problems using oscillator based Ising machines, A new global algorithm for max-cut problem with chordal sparsity, Exponential extrapolation memory for tabu search, Scatter search with stochastic beam search on the coalition formation problem, Solving the maxcut problem by the global equilibrium search, What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO, Hybrid evolutionary search for the traveling repairman problem with profits, Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking, Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem, A multiple search operator heuristic for the max-k-cut problem, A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints, Scatter search for the bandpass problem, Path relinking for unconstrained binary quadratic programming, Black box scatter search for general classes of binary optimization problems, Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs, A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location, Speeding up a memetic algorithm for the max-bisection problem
Uses Software
