A maximum edge-weight clique extraction algorithm based on branch-and-bound-Reference-Cited by-同舟云学术

A maximum edge-weight clique extraction algorithm based on branch-and-bound

Published:2020-08 Issue: Volume:37 Page:100583
ISSN:1572-5286
Container-title:Discrete Optimization
language:en
Short-container-title:Discrete Optimization

Author:

Shimizu Satoshi,Yamaguchi Kazuaki,Masuda Sumio

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science

Reference40 articles.

1. Point matching under non-uniform distortions and protein side chain packing based on efficient maximum clique algorithms;Bahadur K.C;Genome Inform.,2002

2. Greedy and heuristic algorithms for codes and colorings;Etzion;IEEE Trans. Inform. Theory,1998

3. Error-correcting codes over an alphabet of four elements;Bogdanova;Des. Codes Cryptogr.,2001

4. Mining market data: A network approach;Boginski;Comput. Oper. Res.,2006

5. Computers and Intractability - A Guide to the Theory of NP-Completeness;Gary,1979

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

1. Fast optimization for large scale logistics in complex urban systems using the hybrid sparrow search algorithm;International Journal of Geographical Information Science;2023-03-24

3. Stochastic and Risk Averse Maximum Subgraph Problems;Encyclopedia of Optimization;2022-09-21

4. Fast Loop Closure Selection Method with Spatiotemporal Consistency for Multi-Robot Map Fusion;Applied Sciences;2022-05-24

5. Mathematical Programming Models and Exact Algorithms;The Quadratic Unconstrained Binary Optimization Problem;2022