Polyhedral methods for the maximum clique problem.
E. Balas, S. Ceria, G. Cornuéjols, and G. Pataki. Cliques, Coloring, and Satisfiability, volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 11-28. DIMACS/AMS, (1993)
Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/dimacs/Pataki93
%A Balas, Egon
%A Ceria, Sebastián
%A Cornuéjols, Gérard
%A Pataki, Gábor
%B Cliques, Coloring, and Satisfiability
%D 1993
%E Johnson, David S.
%E Trick, Michael A.
%I DIMACS/AMS
%K dblp
%P 11-28
%T Polyhedral methods for the maximum clique problem.
%U http://dblp.uni-trier.de/db/conf/dimacs/dimacs26.html#Pataki93
%V 26
@inproceedings{conf/dimacs/Pataki93,
added-at = {2016-12-21T00:00:00.000+0100},
author = {Balas, Egon and Ceria, Sebastián and Cornuéjols, Gérard and Pataki, Gábor},
biburl = {https://www.bibsonomy.org/bibtex/28cd5514d2c7d208c234567c5c25260c6/dblp},
booktitle = {Cliques, Coloring, and Satisfiability},
crossref = {conf/dimacs/dimacs26},
editor = {Johnson, David S. and Trick, Michael A.},
ee = {http://dimacs.rutgers.edu/Volumes/Vol26.html},
interhash = {e9b8d94c542759867a69af25bb3fac00},
intrahash = {8cd5514d2c7d208c234567c5c25260c6},
keywords = {dblp},
pages = {11-28},
publisher = {DIMACS/AMS},
series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
timestamp = {2016-12-22T11:35:32.000+0100},
title = {Polyhedral methods for the maximum clique problem.},
url = {http://dblp.uni-trier.de/db/conf/dimacs/dimacs26.html#Pataki93},
volume = 26,
year = 1993
}