Fast Heuristics for the Maximum Feasible Subsystem Problem

  title={Fast Heuristics for the Maximum Feasible Subsystem Problem},
  author={John W. Chinneck},
  journal={INFORMS Journal on Computing},
Given an infeasible set of linear constraints, finding the maximum cardinality feasible subsystem is known as the maximum feasible subsystem problem. This problem is known to be NP-hard, but has many practical applications. This paper presents improved heuristics for solving the maximum feasible subsystem problem that are significantly faster than the original, but still highly accurate. (Linear Programming; Artificial Intelligence; Heuristic; Analysis of Algorithms) 


Publications citing this paper.
Showing 1-10 of 44 extracted citations

Branch-and-Cut for the Maximum Feasible Subsystem Problem

SIAM Journal on Optimization • 2008
View 7 Excerpts
Highly Influenced

Automate incident management by decision-making model

2017 IEEE 2nd International Conference on Big Data Analysis (ICBDA)( • 2017
View 1 Excerpt


Publications referenced by this paper.
Showing 1-10 of 25 references

A Parametric Optimization Method for Machine Learning

INFORMS Journal on Computing • 1997
View 3 Excerpts
Highly Influenced

Computer codes for the analysis of infeasible linear programs

J. W. Chinneck
Journal of the Operational Research Society 47 61–72. • 1996
View 15 Excerpts
Highly Influenced

From finding maximum feasible subsystems of linear systems to feedforward neural network design

E. Amaldi
Ph.D. thesis no. 1282, Département de Mathématiques, École Polytechnique Fédérale de Lausanne, Switzerland. • 1994
View 10 Excerpts
Highly Influenced

Improved linear classification via LP infeasibility analysis

J. W. Chinneck
Technical Report SCE-98-09, Department of Systems and Computer Engineering, Carleton University, Ottawa, Canada. • 1998
View 3 Excerpts
Highly Influenced

Feasibility and viability

J. W. Chinneck
Advances in Sensitivity Analysis and Parametric Programming, T. Gal and H. J. Greenberg, eds., International Series in Operations Research and Management Science 6 14-1–14-41, Kluwer Academic Publishers, Boston, Mass. • 1997
View 2 Excerpts
Highly Influenced

MINOS 5.4 user’s guide (preliminary)

B. A. Murtagh, M. A. Saunders
Technical Report SOL 83-20R, • 1993
View 1 Excerpt
Highly Influenced

An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem

Annals of Mathematics and Artificial Intelligence • 1996
View 19 Excerpts

Similar Papers

Loading similar papers…