Node packings on cocomparability graphs

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)


A report on the node packings on cocomparability graphs was presented in the article. A classes of graphs were considered for which the number of maximal cliques is polynomial on n. For cocomparability graphs the approach of Martin was used to obtain a reformulation of the clique inequalities with O(n2) constraints and variables.

Original languageEnglish
Pages (from-to)341-342
Number of pages2
JournalOperations Research Letters
Issue number5
Publication statusPublished - Sept 2003


  • node packing
  • compact formulations
  • comparability graphs
  • polytopes


Dive into the research topics of 'Node packings on cocomparability graphs'. Together they form a unique fingerprint.

Cite this