Polyhedral methods for the maximum clique problem EGON BALAS, SABASTIAN CERIA, GERARD CORNUEJOLS, AND

Gábor Pataki. Polyhedral methods for the maximum clique problem EGON BALAS, SABASTIAN CERIA, GERARD CORNUEJOLS, AND. In David S. Johnson, Michael A. Trick, editors, Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993. Volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 11-28, DIMACS/AMS, 1993.

Abstract

Abstract is missing.