Speeding up a memetic algorithm for the max-bisection problem-Reference-Cited by-同舟云学术

Speeding up a memetic algorithm for the max-bisection problem

Published:2015 Issue:2 Volume:5 Page:151-168
ISSN:2155-3297
Container-title:Numerical Algebra, Control & Optimization
language:en
Short-container-title:

Author:

Zhu Wenxing, ,Liu Yanpo,Lin Geng,

Publisher

American Institute of Mathematical Sciences (AIMS)

Subject

Applied Mathematics,Control and Optimization,Algebra and Number Theory,Applied Mathematics,Control and Optimization,Algebra and Number Theory

Reference43 articles.

1. Using domain decomposition to find graph bisectors,;C. Ashcraft;BIT Numerical Mathematics,1997

2. Better balance by being biased: a 0.8776-approximation for max bisection,;P. Austrin;in Proceedings of SODA,2013

3. An application of combinatorial optimization to statistical physics and circuit layout design,;F. Barahona;Operations Research,1988

4. Differential greedy for the 0-1 equicut problem,;R. Battiti;in Proceeding of the DIMACS Workshop on Network Design: Connectivity and Facilities Location (eds. D. Z. Du and P. M. Pardalos),1997

5. A branch-and-cut algorithm for the equicut problem,;L. Brunetta;Mathematical Programming,1997

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. DSLS: a simple and efficient local search algorithm for the maximum bisection problem;Journal of Heuristics;2023-11-13

2. Graph partitioning: an updated survey;AKCE International Journal of Graphs and Combinatorics;2022-11-22

3. Using Bayesian network technology to predict the semiconductor manufacturing yield rate in IoT;The Journal of Supercomputing;2021-02-01

4. Cellular processing algorithm for the vertex bisection problem: Detailed analysis and new component design;Information Sciences;2019-04

5. An effective iterated tabu search for the maximum bisection problem;Computers & Operations Research;2017-05