Finding the Maximal Independent Sets of a Graph Including the Maximum Using a Multivariable Continuous Polynomial Objective Optimization Formulation-Reference-Cited by-同舟云学术

Finding the Maximal Independent Sets of a Graph Including the Maximum Using a Multivariable Continuous Polynomial Objective Optimization Formulation

Published:2020 Issue: Volume: Page:122-136
ISSN:2194-5357
Container-title:Advances in Intelligent Systems and Computing
language:
Short-container-title:

Author:

Heal Maher,Li Jingpeng

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-52249-0_9

Reference15 articles.

1. Östergård, P.R.: A fast algorithm for the maximum clique problem. Discrete Appl. Math. 120(1), 197–207 (2002)

2. Fang, Z., Li, C.-M., Xu, K.: An exact algorithm based on maxsat reasoning for the maximum weight clique problem. J. Artif. Intell. Res. 55, 799–833 (2016)

3. Tavares, W.A., Neto, M.B.C., Rodrigues, C.D., Michelon, P.: Um algoritmo de branch and bound para o problema da clique máxima ponderada. In: Proceedings of XLVII SBPO, vol. 1 (2015)

4. Shimizu, S., Yamaguchi, K., Saitoh, T., Masuda, S.: Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound. Discrete Appl. Math. 223, 120–134 (2017)

5. Shor, N.Z.: Dual quadratic estimates in polynomial and Boolean programming. Ann. Oper. Res. 25(1), 163–168 (1990)

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

1. The P vs. NP Problem and Attempts to Settle It via Perfect Graphs State-of-the-Art Approach;Lecture Notes in Networks and Systems;2023

2. Formulations and Algorithms to Find Maximal and Maximum Independent Sets of Graphs;2022 International Conference on Computational Science and Computational Intelligence (CSCI);2022-12