Node packings on cocomparability graphs

DOI10.1016/S0167-6377(03)00023-3zbMath1018.05077MaRDI QIDQ1400341

Paulo Barcia, Jorge Orestes Cerdeira

Publication date: 13 August 2003

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

polytopescomparability graphscompact formulationsnode packing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Strengthened 0-1 linear formulation for the daily satellite mission planning ⋮ The \(k\)-Track assignment problem on partial orders

Cites Work

• Using separation algorithms to generate mixed integer model reformulations
• Unnamed Item
• Unnamed Item

This page was built for publication: Node packings on cocomparability graphs