IIS-Hypergraphs

DOI10.1137/S0895480194270469MaRDI QIDQ4717573zbMATH OpenOpenAlexFDO

Authors Jennifer K. Ryan

Publication date 14 January 1997

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480194270469

zbMATH Keywords

greedy algorithmhypergraphinconsistent subsystemlinear programmingtransversal number

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Linear programming (90C05) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 139917
• On the maximum feasible subsystem problem, IISs and IIS-hypergraphs
• Finding the minimum weight IIS cover of an infeasible system of linear inequalities
• scientific article; zbMATH DE number 2186837

Cited in

(3)

• On the maximum feasible subsystem problem, IISs and IIS-hypergraphs
• scientific article; zbMATH DE number 139917 (Why is no real title available?)
• Generating all vertices of a polyhedron is hard

This page was built for publication: IIS-Hypergraphs

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