Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem

DOI10.1287/ijoc.8.2.87zbMath0866.90132OpenAlexW2104771032MaRDI QIDQ5284217

Laura A. Sanchis, Arun K. Jagota

Publication date: 22 January 1997

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/666807473592cfadb15201645ef6111144c0fb75

zbMATH Keywords

NP-completenessmaximum clique problemreinforcement learning techniquestest case generators

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (5)

Using critical sets to solve the maximum independent set problem ⋮ Block linear majorants in quadratic 0--1 optimization ⋮ Simple ingredients leading to very efficient heuristics for the maximum clique problem ⋮ On the Power of Simple Reductions for the Maximum Independent Set Problem ⋮ Depth-first simplicial partition for copositivity detection, with an application to MaxClique

This page was built for publication: Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem