Cardinality-restricted chains and antichains in partially ordered sets

DOI10.1016/0166-218X(95)00045-SzbMath0846.90120OpenAlexW2056881277MaRDI QIDQ1917285

Henry Shum, Leslie E. jun. Trotter

Publication date: 7 July 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(95)00045-s

zbMATH Keywords

coveringpolytopeNP-completefacetsmaximum total weightantichain optimizationchain coveringminimum cardinality cover

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Combinatorics of partially ordered sets (06A07)

Related Items

On the \(k\)-path partition of graphs., Partitioning a weighted partial order

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Anti-blocking polyhedra
• Solving Large-Scale Zero-One Linear Programming Problems
• Solving matching problems with linear programming
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms