Memetic search for the max-bisection problem
From MaRDI portal
Publication:339560
DOI10.1016/j.cor.2012.06.001zbMath1349.90828OpenAlexW2067182837MaRDI QIDQ339560
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.06.001
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Signed and weighted graphs (05C22)
Related Items
Reinforcement learning based tabu search for the minimum load coloring problem ⋮ Tabu search for the cyclic bandwidth problem ⋮ An effective iterated tabu search for the maximum bisection problem ⋮ Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem ⋮ An opposition-based memetic algorithm for the maximum quasi-clique problem ⋮ 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 ⋮ Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem ⋮ Speeding up a memetic algorithm for the max-bisection problem ⋮ A hybrid metaheuristic method for the maximum diversity problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- Solving the maxcut problem by the global equilibrium search
- A new Lagrangian net algorithm for solving max-bisection problems
- A hybrid metaheuristic approach to solving the UBQP problem
- An efficient algorithm for computing the distance between close partitions
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
- An efficient memetic algorithm for the graph partitioning problem
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- A modified VNS metaheuristic for max-bisection problems
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
- A memetic algorithm for graph coloring
- Hybrid evolutionary algorithms for graph coloring
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem
- Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
- Advanced Scatter Search for the Max-Cut Problem
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Randomized heuristics for the Max-Cut problem
- Solving Graph Bisection Problems with Semidefinite Programming
- A Gentle Introduction to Memetic Algorithms
- Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
- A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
- Reducibility among Combinatorial Problems
- A .699-approximation algorithm for Max-Bisection.
