A new branch-and-bound algorithm for the maximum edge-weighted clique problem-Reference-Cited by-同舟云学术

A new branch-and-bound algorithm for the maximum edge-weighted clique problem

Published:2019-10 Issue:1 Volume:278 Page:76-90
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

San Segundo Pablo^ORCID,Coniglio Stefano,Furini Fabio^ORCID,Ljubić Ivana^ORCID

Funder

Spanish Ministry of Science

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference45 articles.

1. 2nd DIMACS implementation challenge – NP hard problems: Maximum clique, graph coloring, and satisfiability. (2017). http://dimacs.rutgers.edu/Challenges/.

2. Accurate tight-binding hamiltonians for two-dimensional and layered materials;Agapito;Physical Review B,2016

3. Multiple methods for protein side chain packing using maximum weight cliques;Brown;Genome Informatics,2006

4. Clique-detection models in computational biochemistry and genomics;Butenko;European Journal of Operational Research,2006

5. On the separation of topology-free rank inequalities for the max stable set problem;Coniglio,2017

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

1. Obtaining the Grundy chromatic number: How bad can my greedy heuristic coloring be?;Computers & Operations Research;2024-08

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

3. Finding Central Cliques in Network Systems;Encyclopedia of Optimization;2023

4. Total Coloring and Total Matching: Polyhedra and Facets;European Journal of Operational Research;2022-11

5. Prediction of Phase-Controlled Breaking Zero Point of Electronic and Electrical Fault Current considering Branch Definition Algorithm;Mobile Information Systems;2022-07-31