On the approximability of finding maximum feasible subsystems of linear systems

DOI10.1007/3-540-57785-8_168MaRDI QIDQ4942660zbMATH OpenFDO

Authors E. Amaldi, Viggo Kann

Publication date 16 March 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57785-8_168

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cited in

(4)

• Consistency, redundancy, and implied equalities in linear systems
• An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem
• A combinatorial approach to the classification problem
• Approximation of Constraint Satisfaction via local search

This page was built for publication: On the approximability of finding maximum feasible subsystems of linear systems

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