Advanced scatter search for the max-cut problem
From MaRDI portal
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
(33)- Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables
- 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
- A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints
- Scatter search for the cutwidth minimization problem
- Greedy differencing edge-contraction heuristic for the max-cut problem
- A memetic algorithm for the max-cut problem
- Hybrid evolutionary search for the traveling repairman problem with profits
- Path relinking for unconstrained binary quadratic programming
- Speeding up a memetic algorithm for the max-bisection problem
- scientific article; zbMATH DE number 6500694 (Why is no real title available?)
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- Memetic search for the max-bisection problem
- Randomized heuristics for the Max-Cut problem
- Solving the maxcut problem by the global equilibrium search
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem
- A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location
- A multiple search operator heuristic for the max-k-cut problem
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
- Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
- Scatter search for the bandpass problem
- Solving the edge‐disjoint paths problem using a two‐stage method
- 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
- Greedy randomized adaptive search procedures with path relinking. An analytical review of designs and implementations
- Enhanced open-source scatter search algorithm for solving quadratic unconstrained binary optimization problems
- Solution-based versus attribute-based tabu search for binary integer programming
- A simple iterative algorithm for maxcut
- Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs
- Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel
- Black box scatter search for general classes of binary optimization problems
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)
