Fast Heuristics for the Maximum Feasible Subsystem Problem

INFORMS Journal on Computing

Volumn 13, Issue 3, 2001, Pages 210-223

  Chinneck, John W ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

Analysis of Algorithms; Artificial intelligence; Heuristic; Linear programming

Indexed keywords

EID: 0346452791     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.13.3.210.12632     Document Type: Article

References (25)

1. Amaldi, E. 1994. From finding maximum feasible subsystems of linear systems to feedforward neural network design. Ph.D. thesis no. 1282, Département de Mathématiques, École Polytechnique Fédérale de Lausanne, Switzerland.
2. Amaldi, E., V. Kann. 1995. The complexity and approximability of finding maximum feasible subsystems of linear relations. Theoretical Computer Science 147 181-210.
3. Amaldi, E., M. Pfetsch, L. Trotter Jr. 1999. Structural and algorithmic properties of the maximum feasible subsystem problem, Proceedings of the Integer Programming and Combinatorial Optimization conference (IPCO'99), Lecture Notes in Computer Science 1610, Springer-Verlag, New York, NY. 45-59.
4. Bennett, K. P., E. Bredensteiner. 1997. A parametric optimization method for machine learning. INFORMS J. on Computing 9 311-318.
5. Blake, C. L., C. J. Merz. 1998. UCI repository of machine learning databases. Department of Information and Computer Science, University of California, Irvine, CA. http://www.ics.uci.edu/̃mlearn/MLRepository.html.
6. Brown, G., G. Graves. 1975. Elastic programming: a new approach to large-scale mixed integer optimization. ORSA/TIMS conference, Las Vegas, NV.
7. Chakravarti, N. 1994. Some Results Concerning Post-Infeasibility Analysis. Eur. J. Oper. Res 73 139-143.
8. Chen, C., O. L. Mangasarian. 1996. Hybrid misclassification minimization. Advances in Computational Mathematics 5 127-136.
9. Chinneck, J. W. 1994. MINOS(IIS): infeasibility analysis using MINOS. Computers and Operations Research 21 1-9.
10. Chinneck, J. W. 1996a. Computer codes for the analysis of infeasible linear programs. Journal of the Operational Research Society 47 61-72.
11. Chinneck, J. W. 1996b. An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem. Annals of Mathematics and Artificial Intelligence 17 127-144.
12. Chinneck, J. W. 1997. Feasibility and viability. 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.
13. Chinneck, J. W. 1998. Improved linear classification via LP infeasibility analysis. Technical Report SCE-98-09, Department of Systems and Computer Engineering, Carleton University, Ottawa, Canada.
14. Chinneck, J. W., E. W. Dravnieks. 1991. Locating minimal infeasible constraint sets in linear programs. ORSA Journal on Computing 3 157-168.
15. CPLEX Optimization, Inc. 1994. Using the CPLEX callable library and CPLEX mixed integer library, CPLEX Optimization Inc., Incline Village, Nevada.
16. Frean, M. 1992. A. "thermal" perceptron learning rule. Neural Computation 4 946-957.
17. Heath, D., S. Kasif, S. Salzburg. 1993. Learning oblique decision trees. Proceedings of the 13th International Conference on Artificial Intelligence, Chambery, France, Morgan Kaufmann, San Mateo, CA. 1002-1007.
18. Karmarkar, N. 1984. A new polynomial time algorithm for linear programming. Combinatorica 4 373-395.
19. Mangasarian, O. 1994. Misclassification minimization. Journal of Global Optimization 5 309-323.
20. Murtagh, B. A., M. A. Saunders. 1993. MINOS 5.4 user's guide (preliminary). Technical Report SOL 83-20R, Systems Optimization Laboratory, Department of Operations Research, Stanford University, Stanford, CA.
21. Murthy, S., S. Kasif, S. Salzberg. 1994. A System for induction of oblique decision trees. J. Artificial Intelligence Research 2 1-32.
22. Parker, M. R. 1995. A set covering approach to infeasibility analysis of linear programming problems and related issues. Ph.D. thesis, Dept. of Mathematics, University of Colorado at Denver, Denver, Colorado.
23. Parker, M. R., J. Ryan. 1996. Finding the minimum weight IIS cover of an infeasible system of linear inequalities. Annals of Mathematics and Artificial Intelligence 17 107-126.
24. Sankaran, J. K. 1993. A note on resolving infeasibility in linear programs by constraint relaxation. Operations Research Letters 13 19-20.
25. Wolfe, P. 1965. The composite simplex algorithm. SIAM Review 7 42-54.