Polyhedral methods for the maximum clique problem.
E. Balas, S. Ceria, G. Cornuéjols, и G. Pataki. Cliques, Coloring, and Satisfiability, том 26 из DIMACS Series in Discrete Mathematics and Theoretical Computer Science, стр. 11-28. DIMACS/AMS, (1993)
Please choose a person to relate this publication to
To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.
You can add a new person with the name "Balas, Egon", or you can "Balas, Egon" with a person entry that is so far only been referred to by another name (such as a former name or an alias name).
Your choice of the person associated to the publication can be saved in our system, so that no other have to make this choice again. Do you want to save your choice?