scientific article; zbMATH DE number 139917

zbMATH Open0765.05075MaRDI QIDQ4028259FDOQ4028259

Authors: Jennifer K. Ryan 

Publication date: 28 March 1993

Title of this publication is not available (Why is that?)

Recommendations

• IIS-Hypergraphs
• On the maximum feasible subsystem problem, IISs and IIS-hypergraphs
• Finding the minimum weight IIS cover of an infeasible system of linear inequalities
• Identifying the Minimal Transversals of a Hypergraph and Related Problems
• scientific article; zbMATH DE number 2186837

zbMATH Keywords

inequalitiestransversalIIS-hypergraphs2-uniformirreducibility inconsistent subsystemssimple greedy algorithm

Mathematics Subject Classification ID

Hypergraphs (05C65)

Cited In (5)

• An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem
• Finding the minimum weight IIS cover of an infeasible system of linear inequalities
• Consistency, redundancy, and implied equalities in linear systems
• On the maximum feasible subsystem problem, IISs and IIS-hypergraphs
• The MIN PFS problem and piecewise linear model estimation

This page was built for publication:

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