An effective branch-and-bound algorithm for the maximum s-bundle problem

DOI10.1016/J.EJOR.2021.05.001MaRDI QIDQ2242188zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

combinatorial optimizationgraph theorybranch and boundclique relaxation\(s\)-bundle

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 2086259 (Why is no real title available?)
• A branch-and-bound approach for maximum quasi-cliques
• A review on algorithms for maximum clique problems
• Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
• Algorithms for the maximum \(k\)-club problem in graphs
• An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem
• An exact bit-parallel algorithm for the maximum clique problem
• Clique relaxation models in social network analysis
• Clique relaxations in social network analysis: the maximum \(k\)-plex problem
• Clique-detection models in computational biochemistry and genomics
• Cohesive subgraph computation over large sparse graphs. Algorithms, data structures, and programming techniques
• Exact algorithms for maximum clique: a computational study
• Finding maximum subgraphs with relatively large vertex connectivity
• Frequency-driven tabu search for the maximum \(s\)-plex problem
• Graph Partitioning and Graph Clustering
• Maximum weight relaxed cliques and Russian doll search revisited
• Node-and edge-deletion NP-complete problems
• On clique relaxation models in network analysis
• On the 2-club polytope of graphs
• Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs

Cited in

(2)

• Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems
• scientific article; zbMATH DE number 1953193 (Why is no real title available?)

Describes a project that uses

Uses Software

• SNAP
• DIMACS

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)