Solving the minimum bisection problem using a biologically inspired computational model
From MaRDI portal
Publication:847667
DOI10.1016/J.TCS.2009.07.031zbMATH Open1191.68321OpenAlexW2067350694MaRDI QIDQ847667FDOQ847667
Authors: Xingchang Liu, Xiaofan Yang, Yong Ding, Sheng-Lin Li 
Publication date: 19 February 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.07.031
Recommendations
- scientific article; zbMATH DE number 1929926
- Biological computation of the solution to the quadratic assignment problem
- Memetic search for the max-bisection problem
- An Efficient Memetic Algorithm for theMax-Bisection Problem
- Computing all efficient solutions of the biobjective minimum spanning tree problem
- Hybrid genetic algorithm within branch-and-cut for the minimum graph bisection problem
- The biobjective minimum cost flow problem
Cites Work
- Title not available (Why is that?)
- DNA Computing
- Strand design for biomolecular computation.
- Title not available (Why is that?)
- Title not available (Why is that?)
- DNA models and algorithms for NP-complete problems
- Title not available (Why is that?)
- A polylogarithmic approximation of the minimum bisection
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (4)
- A biological algorithm to solve the assignment problem based on DNA molecules computation
- Biological computation of the solution to the quadratic assignment problem
- Solving the maximum weighted clique problem based on parallel biological computing model
- Solving two-dimensional cutting stock problem via a DNA computing algorithm
This page was built for publication: Solving the minimum bisection problem using a biologically inspired computational model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q847667)
