### A Comparison of Algorithms for the Maximum Clique Problem

Pierre Hansen, Nenad Mladenović (1992)

The Yugoslav Journal of Operations Research

Similarity:

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

Pierre Hansen, Nenad Mladenović (1992)

The Yugoslav Journal of Operations Research

Similarity:

Serafim Opricović, Lorenzo Eccher, Miodrag Isailovski (1992)

The Yugoslav Journal of Operations Research

Similarity:

Sanjo Zlobec (1991)

The Yugoslav Journal of Operations Research

Similarity:

Dragoš Cvetković, Vladimir Dimitrijevic, Milan Milosavljevic (1992)

The Yugoslav Journal of Operations Research

Similarity:

Ellis L. Johnson, George L. Nemhauser (1992)

The Yugoslav Journal of Operations Research

Similarity:

Gianfranco d'Atri (1978)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

Sanjo Zlobec (1992)

The Yugoslav Journal of Operations Research

Similarity:

I. I. Eremin (1995)

The Yugoslav Journal of Operations Research

Similarity:

Ivan I. Eremin (1998)

The Yugoslav Journal of Operations Research

Similarity:

Mustapha Ç. Pinar (2003)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

A recently introduced dualization technique for binary linear programs with equality constraints, essentially due to Poljak et al. [13], and further developed in Lemaréchal and Oustry [9], leads to simple alternative derivations of well-known, important relaxations to two well-known problems of discrete optimization: the maximum stable set problem and the maximum vertex cover problem. The resulting relaxation is easily transformed to the well-known Lovász $\theta $ number.

Manuel de la Sen (1986)

Stochastica

Similarity:

System similarity and system strict equivalence concepts from Rosenbrock's theory on linear systems are used to establish algebraic conditions of model matching as well as an algebraic method for design of centralized compensators. The ideas seem to be extensible without difficulty to a class of decentralized control.

Bo Lian Liu, Siyuan Chen (2010)

Czechoslovak Mathematical Journal

Similarity:

We give some algebraic conditions for $t$-tough graphs in terms of the Laplacian eigenvalues and adjacency eigenvalues of graphs.

N.I. Karacapilidis, C.P. Pappis (1995)

The Yugoslav Journal of Operations Research

Similarity:

Ilona Lovasi (1992)

The Yugoslav Journal of Operations Research

Similarity:

Jianmin Zhang, Shengyu Shen, Jun Zhang, Weixia Xu, Sikun Li (2011)

Computer Science and Information Systems

Similarity:

M. Minoux (1987)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity: