Solving QUBO problems with cP systems-Reference-Cited by-同舟云学术

Solving QUBO problems with cP systems

Published:2024-05-17 Issue: Volume: Page:
ISSN:2523-8906
Container-title:Journal of Membrane Computing
language:en
Short-container-title:J Membr Comput

Author:

Ciencialová Lucie,Dinneen Michael J.,Nicolescu Radu,Cienciala Luděk

Abstract

AbstractP systems with compound terms (cP systems) have been proposed by Radu Nicolescu in 2018. These expressive cP systems have been used to solve well-known NP-complete problems efficiently, such as the Hamiltonian path, traveling salesman, 3-coloring, and software verification problems. In this paper, we use cP systems to provide an efficient parallel solution to the integer-valued quadratic unconstrained Boolean optimization (QUBO) problem.

Funder

Slezská Univerzita v Opavě

Silesian University in Opava

Publisher

Springer Science and Business Media LLC

Link

https://link.springer.com/content/pdf/10.1007/s41965-024-00155-y.pdf

Reference21 articles.

1. Păun, G. (2000). Computing with membranes. Journal of Computer and System Sciences, 61(1), 108–143.

2. Sosík, P. (2019). P systems attacking hard problems beyond NP: a survey. Journal of Membrane Computing, 1(3), 198–208. https://doi.org/10.1007/s41965-019-00017-y

3. Nicolescu, R., & Henderson, A. (2018). An introduction to cP Systems. In: Graciani, C., Riscos-Núñez, A., Păun, G., Rozenberg, G., Salomaa, A. (eds.) Enjoying Natural Computing: Essays Dedicated to Mario de Jesús Pérez-Jiménez on the Occasion of His 70th Birthday. LNCS 11270, (pp. 204–227). Springer.

4. Cooper, J., & Nicolescu, R. (2019). The Hamiltonian cycle and travelling salesman problems in cP systems. Fundamenta Informaticae, 164(2–3), 157–180.

5. Cooper, J., & Nicolescu, R. (2019). Alternative representations of P systems solutions to the graph colouring problem. Journal of Membrane Computing, 1(2), 112–126.