An effective branch-and-bound algorithm for the maximum s-bundle problem
DOI10.1016/J.EJOR.2021.05.001zbMATH Open1487.90632OpenAlexW3163655551MaRDI QIDQ2242188FDOQ2242188
Authors: Yanyan Li 
Publication date: 9 November 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.05.001
Recommendations
- Maximum weight relaxed cliques and Russian doll search revisited
- Frequency-driven tabu search for the maximum \(s\)-plex problem
- Algorithms for the maximum \(k\)-club problem in graphs
- scientific article; zbMATH DE number 2040957
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Social networks; opinion dynamics (91D30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Graph Partitioning and Graph Clustering
- On clique relaxation models in network analysis
- Clique-detection models in computational biochemistry and genomics
- Clique relaxations in social network analysis: the maximum \(k\)-plex problem
- Title not available (Why is that?)
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- Node-and edge-deletion NP-complete problems
- A branch-and-bound approach for maximum quasi-cliques
- An exact bit-parallel algorithm for the maximum clique problem
- Finding maximum subgraphs with relatively large vertex connectivity
- A review on algorithms for maximum clique problems
- An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem
- Algorithms for the maximum \(k\)-club problem in graphs
- Exact algorithms for maximum clique: a computational study
- Clique relaxation models in social network analysis
- On the 2-club polytope of graphs
- Frequency-driven tabu search for the maximum \(s\)-plex problem
- Maximum weight relaxed cliques and Russian doll search revisited
- Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs
- Cohesive subgraph computation over large sparse graphs. Algorithms, data structures, and programming techniques
Cited In (2)
Uses Software
This page was built for publication: An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2242188)
