Node packings on cocomparability graphs

DOI10.1016/S0167-6377(03)00023-3MaRDI QIDQ1400341zbMATH OpenFDO

Authors Paulo Barcia, Jorge Orestes Cerdeira

Publication date 13 August 2003

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

Full work available at URL https://doi.org/10.1016/S0167-6377(03)00023-3

zbMATH Keywords

compact formulationscomparability graphsnode packingpolytopes

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3902654 (Why is no real title available?)
• Using separation algorithms to generate mixed integer model reformulations

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1400341)