A branch and bound algorithm for the maximum clique problem
From MaRDI portal
Publication:5905591
DOI10.1016/0305-0548(92)90067-FzbMath0757.90082WikidataQ56210435 ScholiaQ56210435MaRDI QIDQ5905591
Panos M. Pardalos, Gregory P. Rodgers
Publication date: 16 January 1993
Published in: Computers \& Operations Research (Search for Journal in Brave)
90C35: Programming involving graphs or networks
90C10: Integer programming
90C20: Quadratic programming
90C09: Boolean programming
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Local minima for indefinite quadratic knapsack problems, An algorithm for finding a maximum clique in a graph, Test case generators and computational results for the maximum clique problem, The maximum clique problem, 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, Solving the maximum clique problem using a tabu search approach
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
