Memetic search for the max-bisection problem
From MaRDI portal
Publication:339560
DOI10.1016/J.COR.2012.06.001zbMATH Open1349.90828OpenAlexW2067182837MaRDI QIDQ339560FDOQ339560
Authors: Qinghua Wu, Jin-Kao Hao 
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
Recommendations
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Signed and weighted graphs (05C22)
Cites Work
- Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
- Title not available (Why is that?)
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Title not available (Why is that?)
- Reducibility among combinatorial problems
- Title not available (Why is that?)
- An efficient memetic algorithm for the graph partitioning problem
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- Title not available (Why is that?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- A Gentle Introduction to Memetic Algorithms
- Hybrid evolutionary algorithms for graph coloring
- A memetic algorithm for graph coloring
- A .699-approximation algorithm for Max-Bisection.
- A hybrid metaheuristic approach to solving the UBQP problem
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem
- Advanced scatter search for the max-cut problem
- Randomized heuristics for the Max-Cut problem
- Solving Graph Bisection Problems with Semidefinite Programming
- Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
- A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
- Solving the maxcut problem by the global equilibrium search
- A new Lagrangian net algorithm for solving max-bisection problems
- An efficient algorithm for computing the distance between close partitions
- A modified VNS metaheuristic for max-bisection problems
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
Cited In (18)
- Solving the multidimensional maximum bisection problem by a genetic algorithm and variable neighborhood search
- An effective iterated tabu search for the maximum bisection problem
- A memetic algorithm with bucket elimination for the still life problem
- Maxima units search (MUS) algorithm: methodology and applications
- Solving the minimum bisection problem using a biologically inspired computational model
- Speeding up a memetic algorithm for the max-bisection problem
- Reinforcement learning based tabu search for the minimum load coloring problem
- An opposition-based memetic algorithm for the maximum quasi-clique problem
- Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem
- Tabu search for the cyclic bandwidth problem
- Memetic algorithm for the antibandwidth maximization problem
- Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem
- Solving the maximally balanced connected partition problem in graphs by using genetic algorithm
- A modified VNS metaheuristic for max-bisection problems
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem
- A hybrid metaheuristic method for the maximum diversity problem
- A multiple search operator heuristic for the max-k-cut problem
- A memetic algorithm for the max-cut problem
Uses Software
This page was built for publication: Memetic search for the max-bisection problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339560)
