On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem

No abstract is available for this paper.

• Publication year

  2017

• Venue

  Computers & Operations Research

• Publication date

  2017-08-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.cor.2017.02.017
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Incremental MaxSAT Reasoning to Reduce Branches in a Branch-and-Bound Algorithm for MaxClique

  2015cited by this paper
• Guest Editor Introduction

  2015cited by this paper
• A review on algorithms for maximum clique problems

  2015cited by this paper
• Practical Aspects of the Graph Parameter Boolean-width

  2014cited by this paper
• Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique Problem

  2014cited by this paper
• The Shape of the Search Tree for the Maximum Clique Problem and the Implications for Parallel Branch and Bound

  2014cited by this paper
• Relaxed approximate coloring in exact maximum clique search

  2014cited by this paper
• Multi-Threading a State-of-the-Art Maximum Clique Algorithm

  2013cited by this paper
• Breakout Local Search for maximum clique problems

  2013cited by this paper
• Combining MaxSAT Reasoning and Incremental Upper Bound for the Maximum Clique Problem

  2013influential reference
• A tutorial on branch and cut algorithms for the maximum stable set problem

  2012cited by this paper
• Distributing an Exact Algorithm for Maximum Clique: maximising the costup

  2012cited by this paper
• Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem

  2011cited by this paper
• Cooperating local search for the maximum clique problem

  2011cited by this paper
• Listing All Maximal Cliques in Large Sparse Real-World Graphs

  2011cited by this paper
• An exact bit-parallel algorithm for the maximum clique problem

  2011cited by this paper
• Local search with edge weighting and configuration checking heuristics for minimum vertex cover

  2011cited by this paper
• Dynamic Local Search for the Maximum Clique Problem

  2011cited by this paper
• An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem

  2010influential reference
• A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique

  2010cited by this paper
• Combining Graph Structure Exploitation and Propositional Reasoning for the Maximum Clique Problem

  2010cited by this paper
• An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments

  2009cited by this paper
• Identification of a 5-Protein Biomarker Molecular Signature for Predicting Alzheimer's Disease

  2008cited by this paper
• Simple ingredients leading to very efficient heuristics for the maximum clique problem

  2008cited by this paper
• Random constraint satisfaction: Easy generation of hard (satisfiable) instances

  2007cited by this paper
• An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments

  2007cited by this paper
• An improved branch and bound algorithm for the maximum clique problem

  2007cited by this paper
• Mining market data: A network approach

  2006cited by this paper
• Optimal Protein Structure Alignment Using Maximum Cliques

  2005cited by this paper
• Using Constraint Programming to Solve the Maximum Clique Problem

  2003cited by this paper
• A fast algorithm for the maximum clique problem

  2002cited by this paper
• Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique

  2002cited by this paper
• Efficient branch-and-bound algorithms for finding a maximum clique

  2001cited by this paper
• Greedy and Heuristic Algorithms for Codes and Colorings

  1998cited by this paper
• Keller’s cube-tiling conjecture is false in high dimensions

  1992cited by this paper
• An exact algorithm for the maximum clique problem

  1990cited by this paper
• A branch and bound algorithm for the maximum clique problem

  1990cited by this paper

• Review of automated parallel test form assembly

  2026cites this paper
• Exact Clique Number Manipulation via Edge Interdiction

  2026cites this paper
• Graph-based evolutionary search for maximum independent union of cliques problem

  2026cites this paper
• Comparative algorithm performance evaluation and prediction for the maximum clique problem using instance space analysis

  2025cites this paper
• ARM-Explainer - Explaining and improving graph neural network predictions for the maximum clique problem using node features and association rule mining

  2025cites this paper
• A greedy approach to solve maximum independent set problem: Differential Malatya independent set algorithm

  2025cites this paper
• Learning to Select MCP Algorithms: From Traditional ML to Dual-Channel GAT-MLP

  2025cites this paper
• A Reduction-based Algorithm for the Clique Interdiction Problem

  2025cites this paper
• CliReg: Clique-Based Robust Point Cloud Registration

  2025influential citation
• Unsupervised Ordering for Maximum Clique

  2025cites this paper
• Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space

  2025cites this paper
• Learning driven three-phase search for the maximum independent union of cliques problem

  2024cites this paper
• Theoretically and Practically Efficient Maximum Defective Clique Search

  2024cites this paper
• A Faster Branching Algorithm for the Maximum k-Defective Clique Problem

  2024cites this paper
• Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks

  2024cites this paper
• Optimal Neighborhood Exploration for Dynamic Independent Sets

  2024cites this paper
• A Fast Maximum Clique Algorithm Based on Network Decomposition for Large Sparse Networks

  2024cites this paper
• Maximum k-Plex Computation: Theory and Practice

  2024cites this paper
• A Short Review on Novel Approaches for Maximum Clique Problem: from Classical algorithms to Graph Neural Networks and Quantum algorithms

  2024cites this paper
• Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance

  2024cites this paper
• Geometric Deep Learning sub-network extraction for Maximum Clique Enumeration

  2024cites this paper
• Improved Exact and Heuristic Algorithms for Maximum Weight Clique

  2023cites this paper
• Efficient Maximum Fair Clique Search Over Large Networks

  2023cites this paper
• Parallel Bounded Search for the Maximum Clique Problem

  2023cites this paper
• The Maximum Clique Problem and Integer Programming Models, Their Modifications, Complexity and Implementation

  2023cites this paper
• Relaxed Graph Color Bound for the Maximum k-plex Problem

  2023cites this paper
• Efficient Maximum k-Defective Clique Computation with Improved Time Complexity

  2023cites this paper
• A Refined Upper Bound and Inprocessing for the Maximum K-plex Problem

  2023cites this paper
• Neighborhood Skyline on Graphs: Concepts, Algorithms and Applications

  2023cites this paper
• Algorithms for the Uniqueness of the Longest Common Subsequence.

  2023cites this paper
• Determine transposable genes when the orders of genes are different

  2023cites this paper
• Longest common subsequence algorithms and applications in determining transposable genes

  2023cites this paper
• Clique Search in Graphs of Special Class and Job Shop Scheduling

  2022cites this paper
• On fast enumeration of maximal cliques in large graphs

  2022cites this paper
• Probe Machine Based Computing Model for Maximum Clique Problem

  2022cites this paper
• The Maximum Clique Problem for Permutation Hamming Graphs

  2022cites this paper
• An approximation lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network

  2022cites this paper
• CliSAT : a SAT-based exact algorithm for hard maximum clique problems

  2022influential citation
• A local dense decision-making method for solving the maximum clique problem in large-scale undirected graphs

  2022cites this paper
• The minimum quasi-clique partitioning problem: Complexity, formulations, and a computational study

  2022cites this paper
• Finding Near-Optimal Weight Independent Sets at Scale

  2022cites this paper
• CliSAT: A new exact algorithm for hard maximum clique problems

  2022cites this paper
• Efficient Maximum k-Plex Computation over Large Sparse Graphs

  2022cites this paper
• MASTERARBEIT / MASTER’S THESIS

  2021cites this paper
• Exact Maximum Clique Algorithm for Different Graph Types Using Machine Learning

  2021cites this paper
• A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs

  2021cites this paper
• A New Upper Bound Based on Vertex Partitioning for the Maximum K-plex Problem

  2021cites this paper
• A new branch-and-filter exact algorithm for binary constraint satisfaction problems

  2021cites this paper
• Targeted Branching for the Maximum Independent Set Problem

  2021cites this paper
• A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts

  2021cites this paper
• WeGotYouCovered: The Winning Solver from the PACE 2019 Challenge, Vertex Cover Track

  2020cites this paper
• Improved Branching Strategies for Maximum Independent Sets

  2020cites this paper
• Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems

  2020cites this paper
• Engineering Generalized Reductions for the Maximum Weight Independent Set Problem

  2020cites this paper
• Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations

  2020cites this paper
• Solving optimization problems with Rydberg analog quantum computers: Realistic requirements for quantum advantage using noisy simulation and classical benchmarks

  2020cites this paper
• Testing a Heuristic Algorithm for Finding a Maximum Clique on DIMACS and Facebook Graphs

  2020cites this paper
• A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflict Graph

  2020cites this paper
• Improving the Performance of Stochastic Local Search for Maximum Vertex Weight Clique Problem Using Programming by Optimization

  2020cites this paper
• Solving longest common subsequence problems via a transformation to the maximum clique problem

  2020cites this paper
• Efficient maximum clique computation and enumeration over large sparse graphs

  2020influential citation
• SCCWalk: An efficient local search algorithm and its improvements for maximum weight clique problem

  2020cites this paper
• Learning fine-grained search space pruning and heuristics for combinatorial optimization

  2020cites this paper
• Recent Advances in Practical Data Reduction

  2020cites this paper
• Parallel Maximum Clique Algorithm Using Integer Programming for Uniform Test Forms Assembly

  2020cites this paper
• A new branch-and-bound algorithm for the Maximum Weighted Clique Problem

  2019influential citation
• A new branch-and-bound algorithm for the maximum edge-weighted clique problem

  2019cites this paper
• Computing Maximum Independent Sets over Large Sparse Graphs

  2019cites this paper
• Finding a Maximum Clique in Dense Graphs via χ2 Statistics

  2019cites this paper
• Robustness to spontaneous emission of a variational quantum algorithm

  2019cites this paper
• Learning Multi-Stage Sparsification for Maximum Clique Enumeration

  2019influential citation
• Lower Bound for (Sum) Coloring Problem

  2019influential citation
• WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track

  2019influential citation
• Understanding the Empirical Hardness of Random Optimisation Problems

  2019cites this paper
• Efficient Maximum Clique Computation over Large Sparse Graphs

  2019cites this paper
• A memory efficient maximal clique enumeration method for sparse graphs with a parallel implementation

  2019cites this paper
• An Efficient Structural Descriptor Sequence to Identify Graph Isomorphism and Graph Automorphism

  2019cites this paper
• Fine-grained Search Space Classification for Hard Enumeration Variants of Subset Problems

  2019cites this paper
• The maximum clique interdiction problem

  2019influential citation
• A Two-Stage MaxSAT Reasoning Approach for the Maximum Weight Clique Problem

  2018cites this paper
• The Maximum Clique Interdiction Game

  2018influential citation
• A Maximum Edge-Weight Clique Extraction Algorithm Based on Branch-and-Bound

  2018influential citation
• A new upper bound for the maximum weight clique problem

  2018cites this paper
• A Branch-and-Bound Based Exact Algorithm for the Maximum Edge-Weight Clique Problem

  2018cites this paper
• Searching for Maximum Clique by DNA Origami

  2018cites this paper
• MASTERARBEIT / MASTER’S THESIS ”Engineering NOI-based Coarsening Algorithms for Multilevel Graph Partitioning“

  2017cites this paper