Cargando…
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...
Autores principales: | Wang, Zhaocai, Pu, Jun, Cao, Liling, Tan, Jian |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2015
|
Materias: | |
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 |
Ejemplares similares
-
A Parallel DNA Algorithm for Solving the Quota Traveling Salesman Problem Based on Biocomputing Model
por: Wang, Zhaocai, et al.
Publicado: (2022) -
Parallelizing Assignment Problem with DNA Strands
por: Khorsand, Babak, et al.
Publicado: (2020) -
Multilevel Parallel Computations for Solving Multistage Multicriteria Optimization Problems
por: Gergel, Victor, et al.
Publicado: (2020) -
Solving an airport ground service task assignment problem with an exact algorithm
por: Tian, Qiannan, et al.
Publicado: (2022) -
Solving the Credit Assignment Problem With the Prefrontal Cortex
por: Stolyarova, Alexandra
Publicado: (2018)