A new branch-and-bound algorithm for the Maximum Weighted Clique Problem-Reference-Cited by-同舟云学术

A new branch-and-bound algorithm for the Maximum Weighted Clique Problem

Published:2019-10 Issue: Volume:110 Page:18-33
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

San Segundo Pablo^ORCID,Furini Fabio^ORCID,Artieda Jorge

Funder

Ministry of Science, Innovation and Universities

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modelling and Simulation,General Computer Science

Reference38 articles.

1. Clique-detection models in computational biochemistry and genomics;Butenko;Eur. J. Oper. Res.,2006

2. An exact algorithm for the maximum clique problem;Carraghan;Oper. Res. Lett.,1990

3. A Primer in Column Generation;Desrosiers,2005

4. DIMACS 2nd implementation challenge - NPHard problems: maximum clique, graph coloring, and satisfiability, 1993. http://dimacs.rutgers.edu/Challenges/ (last modified, 2017).

5. Simple and fast: Improving a branch-and-bound algorithm for maximum clique;Fahle,2002

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

1. Enhanced Branch and Bound Algorithm: Minimizing Subproblem Complexity in Power Dispatch;IEEE Access;2024

2. CliSAT: A new exact algorithm for hard maximum clique problems;European Journal of Operational Research;2023-06

3. Towards Optimal Parallelism-Aware Service Chaining and Embedding;IEEE Transactions on Network and Service Management;2022-09

4. Graph-based relevancy-redundancy gene selection method for cancer diagnosis;Computers in Biology and Medicine;2022-08

5. Boosting ant colony optimization via solution prediction and machine learning;Computers & Operations Research;2022-07