A branch and bound algorithm for the maximum clique problem
From MaRDI portal
Publication:5905591
DOI10.1016/0305-0548(92)90067-FzbMath0757.90082OpenAlexW2020567423WikidataQ56210435 ScholiaQ56210435MaRDI QIDQ5905591
Panos M. Pardalos, Gregory P. Rodgers
Publication date: 16 January 1993
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(92)90067-f
Programming involving graphs or networks (90C35) Integer programming (90C10) Quadratic programming (90C20) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Solving the maximum clique problem using a tabu search approach, Large-scale mining co-expressed genes in \textit{Arabidopsis} anther: from pair to group, Problems of discrete optimization: challenges and main approaches to solve them, Building an iterative heuristic solver for a quantum annealer, Solving the maximum vertex weight clique problem via binary quadratic programming, Unnamed Item, Optimization of a quadratic function with a circulant matrix, Computational aspects of a branch and bound algorithm for quadratic zero- one programming, An Efficient Approximation Algorithm for Finding a Maximum Clique Using Hopfield Network Learning, Fixed interval scheduling: models, applications, computational complexity and algorithms, An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network, A combinatorial column generation algorithm for the maximum stable set problem, On the minimum number of logical clauses inferred from examples, Diversification strategies in tabu search algorithms for the maximum clique problem, An algorithm for finding a maximum weighted independent set in an arbitrary graph, The unconstrained binary quadratic programming problem: a survey, Unnamed Item, A matrix nonconvex relaxation approach to unconstrained binary polynomial programs, A simple simulated annealing algorithm for the maximum clique problem, Exact algorithms for maximum clique: a computational study, Local minima for indefinite quadratic knapsack problems, Finding quasi core with simulated stacked neural networks, A tutorial on branch and cut algorithms for the maximum stable set problem, A quadratic programming approach to the determination of an upper bound on the weighted stability number, A tight lower bound for a special case of quadratic 0-1 programming, A polyhedral study of the generalized vertex packing problem, Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem, Computing maximum \(k\)-defective cliques in massive graphs, Indirect unstructured hex-dominant mesh generation using tetrahedra recombination, Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound, Global equilibrium search applied to the unconstrained binary quadratic optimization problem, Lagrangean decompositions for the unconstrained binary quadratic programming problem, An algorithm for finding a maximum clique in a graph, Depth-first simplicial partition for copositivity detection, with an application to MaxClique, A global continuation algorithm for solving binary quadratic programming problems, Test case generators and computational results for the maximum clique problem, A continuation approach for solving binary quadratic program based on a class of NCP-functions, One-pass heuristics for large-scale unconstrained binary quadratic problems, The maximum clique problem, Modelling competitive Hopfield networks for the maximum clique problem, An unconstrained quadratic binary programming approach to the vertex coloring problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
- An exact algorithm for the maximum clique problem
- Constrained global optimization: algorithms and applications
- Clique detection for nondirected graphs: Two new algorithms
- Geometric algorithms and combinatorial optimization
- Graph separation techniques for quadratic zero-one programming
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Finding a Maximum Clique in an Arbitrary Graph
- Algorithms for maximum independent sets
- Finding a Maximum Independent Set
- Branch-and-Bound Methods: A Survey
- Branch-and-Bound Methods: General Formulation and Properties
- Algorithm 457: finding all cliques of an undirected graph
