Memetic search for the max-bisection problem
From MaRDI portal
Recommendations
Cites work
- A .699-approximation algorithm for Max-Bisection.
- A Gentle Introduction to Memetic Algorithms
- A hybrid metaheuristic approach to solving the UBQP problem
- A memetic algorithm for graph coloring
- A modified VNS metaheuristic for max-bisection problems
- A new Lagrangian net algorithm for solving max-bisection problems
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem
- A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
- Advanced scatter search for the max-cut problem
- An efficient algorithm for computing the distance between close partitions
- An efficient memetic algorithm for the graph partitioning problem
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 558543 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 960162 (Why is no real title available?)
- Hybrid evolutionary algorithms for graph coloring
- Improved approximation algorithms for MAX k-cut and MAX BISECTION
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- Randomized heuristics for the Max-Cut problem
- Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
- Reducibility among combinatorial problems
- Solving Graph Bisection Problems with Semidefinite Programming
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Solving the maxcut problem by the global equilibrium search
Cited in
(20)- Maxima units search (MUS) algorithm: methodology and applications
- An effective iterated tabu search for the maximum bisection problem
- A memetic algorithm with bucket elimination for the still life problem
- Reinforcement learning based tabu search for the minimum load coloring problem
- An opposition-based memetic algorithm for the maximum quasi-clique problem
- A memetic algorithm for the max-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
- Solving the maximally balanced connected partition problem in graphs by using genetic algorithm
- Tabu search for the cyclic bandwidth problem
- Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack 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
- Solving the multidimensional maximum bisection problem by a genetic algorithm and variable neighborhood search
- Memetic algorithm for the antibandwidth maximization problem
- A MILP model for the connected multidimensional maximum bisection problem
- A double-stage heuristic algorithm for the antibandwidth maximization problem via the linear bottleneck assignment optimization
- Solving the minimum bisection problem using a biologically inspired computational model
- A modified VNS metaheuristic for max-bisection problems
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)
