Abstract
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 language | English |
|---|---|
| Pages (from-to) | 341-342 |
| Number of pages | 2 |
| Journal | Operations Research Letters |
| Volume | 31 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - Sept 2003 |
Keywords
- node packing
- compact formulations
- comparability graphs
- polytopes