A Parallel Biological Optimization Algorithm to Solve the Unbalanced Assignment Problem Based on DNA Molecular Computing

The unbalanced assignment problem (UAP) is to optimally resolve the problem of assigning n jobs to m individuals (m < n), such that minimum cost or maximum profit obtained. It is a vitally important Non-deterministic Polynomial (NP) complete problem in operation management and applied mathematics...

Descripción completa

Detalles Bibliográficos
Autores principales: Wang, Zhaocai, Pu, Jun, Cao, Liling, Tan, Jian
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2015
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4632804/
https://www.ncbi.nlm.nih.gov/pubmed/26512650
http://dx.doi.org/10.3390/ijms161025338

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4632804/
https://www.ncbi.nlm.nih.gov/pubmed/26512650
http://dx.doi.org/10.3390/ijms161025338

Ejemplares similares