Test case generators and computational results for the maximum clique problem

DOI10.1007/BF01096415zbMath0791.90063MaRDI QIDQ1310979

Jonas Hasselberg, Panos M. Pardalos, George L. Vairaktarakis

Publication date: 26 January 1994

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

global optimizationmaximum cliquetest problem generators

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

A fast algorithm for the maximum clique problem, Subgraph extraction and metaheuristics for the maximum clique problem, An exact algorithm for the maximum stable set problem, Edge coloring of graphs, uses, limitation, complexity, Reducing graph coloring to clique search, Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, Monotonic optimization based decoding for linear codes, Error-tolerance pooling designs based on Johnson graphs, Using critical sets to solve the maximum independent set problem, Estimating the fractional chromatic number of a graph, Decomposing clique search problems into smaller instances based on node and edge colorings, Constructing test functions for global optimization using continuous formulations of graph problems, A tutorial on branch and cut algorithms for the maximum stable set problem, On the chromatic number of graphs, Depth-first simplicial partition for copositivity detection, with an application to MaxClique, A clique search problem and its application to machine scheduling, A coloring problem on the \(n\)-cube, Estimating clique size by coloring the nodes of auxiliary graphs, Numerical experiments with LP formulations of the maximum clique problem, The maximum clique problem

Cites Work

• Unnamed Item
• An exact algorithm for the maximum clique problem
• The maximum clique problem
• A reduction of Keller's conjecture
• A combinatorial approach for Keller's conjecture
• Über lückenlose Ausfüllung des \(n\)-dimensionalen Raumes durch kongruente Würfel
• A new table of constant weight codes
• Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
• Finding a Maximum Clique in an Arbitrary Graph
• Keller’s cube-tiling conjecture is false in high dimensions
• Construction of test problems in quadratic bivalent programming
• Algebraic Tiling
• Optimization of Reduced Dependencies for Synchronous Sequential Machines
• Sur le problème de factorisation des groupes cycliques
• A branch and bound algorithm for the maximum clique problem