Erratum: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments

DOI10.1007/s10898-008-9362-2zbMath1180.90365OpenAlexW4247132858MaRDI QIDQ839051

Etsuji Tomita, Toshikatsu Kameda

Publication date: 1 September 2009

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

Full work available at URL: https://doi.org/10.1007/s10898-008-9362-2

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments, Local search with edge weighting and configuration checking heuristics for minimum vertex cover