A branch and bound algorithm for the maximum clique problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4059145 (Why is no real title available?)
- scientific article; zbMATH DE number 3713491 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
- Algorithm 457: finding all cliques of an undirected graph
- Algorithms for maximum independent sets
- An exact algorithm for the maximum clique problem
- Branch-and-Bound Methods: A Survey
- Branch-and-Bound Methods: General Formulation and Properties
- Clique detection for nondirected graphs: Two new algorithms
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Constrained global optimization: algorithms and applications
- Finding a Maximum Clique in an Arbitrary Graph
- Finding a Maximum Independent Set
- Geometric algorithms and combinatorial optimization
- Graph separation techniques for quadratic zero-one programming
- Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
- Roof duality, complementation and persistency in quadratic 0–1 optimization
Cited in
(60)- On the minimum number of logical clauses inferred from examples
- On solving the maximum clique problem
- Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound
- Some zero-one linear programming reformulations for the maximum clique problem
- Numerical experiments with LP formulations of the maximum clique problem
- The maximum clique problem
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- A unified pre-training and adaptation framework for combinatorial optimization on graphs
- A New Branch and Bound Algorithm for the Clique Partitioning Problem
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- Modelling competitive Hopfield networks for the maximum clique problem
- The unconstrained binary quadratic programming problem: a survey
- A polyhedral study of the generalized vertex packing problem
- A tight lower bound for a special case of quadratic 0-1 programming
- Large-scale mining co-expressed genes in \textit{Arabidopsis} anther: from pair to group
- A quadratic programming approach to the determination of an upper bound on the weighted stability number
- Indirect unstructured hex-dominant mesh generation using tetrahedra recombination
- A New Approach for Solving the Maximum Clique Problem
- A tutorial on branch and cut algorithms for the maximum stable set problem
- A combinatorial column generation algorithm for the maximum stable set problem
- One-pass heuristics for large-scale unconstrained binary quadratic problems
- A global continuation algorithm for solving binary quadratic programming problems
- Solving the maximum vertex weight clique problem via binary quadratic programming
- Global equilibrium search applied to the unconstrained binary quadratic optimization problem
- Computing maximum \(k\)-defective cliques in massive graphs
- A fast algorithm for the maximum clique problem
- A parallel branch and bound algorithm for the maximum labelled clique problem
- An algorithm for finding a maximum weighted independent set in an arbitrary graph
- A simple simulated annealing algorithm for the maximum clique problem
- A branch-and-bound algorithm for solving max-\(k\)-cut problem
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network
- Local minima for indefinite quadratic knapsack problems
- On comparing algorithms for the maximum clique problem
- A multi-KP modeling for the maximum-clique problem
- A branch-and-cut algorithm for the maximum covering cycle problem
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- A dynamic programming approach for timing and designing clique algorithms
- A continuation approach for solving binary quadratic program based on a class of NCP-functions
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
- An algorithm for finding a maximum clique in a graph
- Lagrangean decompositions for the unconstrained binary quadratic programming problem
- Test case generators and computational results for the maximum clique problem
- An Efficient Approximation Algorithm for Finding a Maximum Clique Using Hopfield Network Learning
- A pivoting-based heuristic for the maximum clique problem.
- Lexicographic breadth first-search and branch and bound algorithms for the maximum clique problem
- Aspects of stability for multicriteria quadratic problems of Boolean programming
- Stability measures for multicriteria quadratic Boolean programming problem of finding extremum solutions
- Building an iterative heuristic solver for a quantum annealer
- Depth-first simplicial partition for copositivity detection, with an application to MaxClique
- Solving the maximum clique problem using a tabu search approach
- A bisection method for solving distance-based clustering problems globally
- Diversification strategies in tabu search algorithms for the maximum clique problem
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
- A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
- Exact algorithms for maximum clique: a computational study
- Finding quasi core with simulated stacked neural networks
- Optimization of a quadratic function with a circulant matrix
- Problems of discrete optimization: challenges and main approaches to solve them
This page was built for publication: A branch and bound algorithm for the maximum clique problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5905591)
