An effective iterated tabu search for the maximum bisection problem
From MaRDI portal
Publication:1652221
DOI10.1016/j.cor.2016.12.012zbMath1391.90610OpenAlexW2563073959WikidataQ56524032 ScholiaQ56524032MaRDI QIDQ1652221
Fuda Ma, Jin-Kao Hao, Yang Wang
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.12.012
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (4)
Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization ⋮ Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables ⋮ An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks ⋮ Multi-wave tabu search for the Boolean quadratic programming problem with generalized upper bound constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- An iterated local search heuristic for the split delivery vehicle routing problem
- Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling
- Memetic search for the max-bisection problem
- A new Lagrangian net algorithm for solving max-bisection problems
- An exact combinatorial algorithm for minimum graph bisection
- Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel
- A modified VNS metaheuristic for max-bisection problems
- A branch-and-cut algorithm for the equicut problem
- Minimizing breaks by maximizing cuts.
- A discrete dynamic convexized method for the max-cut problem
- Speeding up a memetic algorithm for the max-bisection problem
- A projected gradient algorithm for solving the maxcut SDP relaxation
- Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
- Advanced Scatter Search for the Max-Cut Problem
- Experimental Methods for the Analysis of Optimization Algorithms
- Some NP-complete problems in quadratic and nonlinear programming
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- An Efficient Heuristic Procedure for Partitioning Graphs
- Randomized heuristics for the Max-Cut problem
- Solving Graph Bisection Problems with Semidefinite Programming
- Fast approximation algorithms on maxcut, k-coloring, and k-color ordering for VLSI applications
- An Efficient Memetic Algorithm for theMax-Bisection Problem
- Handbook of metaheuristics
This page was built for publication: An effective iterated tabu search for the maximum bisection problem
