Some structural and algorithmic properties of the maximum feasible subsystem problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1610, Issue , 1999, Pages 45-59

  Amaldi, Edoardo ^a   Pfetsch, Marc E ^b   Trotter, Leslie E ^a  

^a Department of Obstetrics Gynecology   (United States)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; DISCRIMINANT ANALYSIS; LINEAR PROGRAMMING; LINEAR SYSTEMS;

ALGORITHMIC PROPERTIES; CARDINALITIES; FEASIBLE SUBSYSTEMS; IN-FIELD; MAXIMUM FEASIBLE SUBSYSTEM PROBLEM; NP-HARD; POLYTOPES; REALIZABILITY;

INTEGER PROGRAMMING;

EID: 84948977621     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48777-8_4     Document Type: Conference Paper

References (31)

1. C. C. Aggarwal, R. K. Ahuja, J. Hao, and J. B. Orlin, Diagnosing infeasibilities in network flow problems, Mathematical Programming, 81 (1998), pp. 263- 280.
2. E. Amaldi, From finding maximum feasible subsystems of linear systems to feedforward neural network design, PhD thesis, Dep. of Mathematics, EPF-Lausanne, 1994.
3. E. Amaldi and V. Kann, The complexity and, approximability of finding maximum feasible subsystems of linear relations, Theoretical Comput. Sci., 147 (1995), pp. 181-210.
4. E. Amaldi and V. Kann, On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems, Theoretical Comput. Sci., 209 (1998), pp. 237-260.
5. S. Arora, L. Babai, J. Stern, and Z. Sweedyk, The hardness of approximate optima in lattices, codes, and systems of linear equations, J. Comput. Syst. Sci., 54 (1997), pp. 317-331.
6. A. Bachem and M. Grötschel, New aspects of polyhedral theory, in Optimization and Operations Research, A. Bachem, ed., Modern Applied Mathematics, North Holland, 1982, ch. 1.2, pp. 51 - 106.
7. E. Balas and S. M. Ng, On the set covering polytope: All the facets with coefficients in {0,1,2}, Mathematical Programming, 43 (1989), pp. 57-69.
8. L. Blum, F. Cucker, M. Shub, and S. Smale, Complexity and Real Computation, Springer-Verlag, 1997.
9. J. Bokowski and B. Sturmfels, Computational Synthetic Geometry, no. 1355 in Lecture Notes in Mathematics, Springer-Verlag, 1989.
10. N. Chakravarti, Some results concerning post-infeasibility analysis, Eur. J. Oper. Res., 73 (1994), pp. 139-143.
11. J. Chinneck, Computer codes for the analysis of infeasible linear programs, J. Oper. Res. Soc., 47 (1996), pp. 61-72.
12. J. Chinneck,, An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem, Annals of Mathematics and Artificial Intelligence, 17 (1996), pp. 127-144.
13. J. Chinneck,, Feasibility and viability, in Advances in Sensitivity Analysis and Parametric Programming, T. Gál and H. Greenberg, eds., Kluwer Academic Publishers, 1997.
14. J. Chinneck and E. Dravnieks, Locating minimal infeasible constraint sets in linear programs, ORSA Journal on Computing, 3 (1991), pp. 157-168.
15. M. Dell’Amico, F. Maffioli, and S. Martello, Annotated Bibliographies in Combinatorial Optimization, John Wiley, 1997.
16. K. Fan, On systems of linear inequalities, in Linear Inequalities and Related Systems, H. W. Kuhn and A. W. Tucker, eds., no. 38 in Annals of Mathematical Studies, Princeton University Press, NJ, 1956, pp. 99-156.
17. J. Gleeson and J. Ryan, Identifying minimally infeasible subsystems of inequalities, ORSA Journal on Computing, 2 (1990), pp. 61-63.
18. H. J. Greenberg, Consistency, redundancy, and implied equalities in linear systems, Annals of Mathematics and Artificial Intelligence, 17 (1996), pp. 37-83.
19. H. J. Greenberg and F. H. Murphy, Approaches to diagnosing infeasible linear programs, ORSA Journal on Computing, 3 (1991), pp. 253-261.
20. J. Håstad, Some optimal inapproximability results, in Proc. Twenty-ninth Ann. ACM Symp. Theory of Comp., ACM, 1997, pp. 1-10.
21. M. Laurent, A generalization of antiwebs to independence systems and their canonical facets, Mathematical Programming, 45 (1989), pp. 97-108.
22. O. L. Mangasarian, Mis classification minimization, J. of Global Optimization, 5 (1994), pp. 309-323.
23. B. Mishra, Computational real algebraic geometry, in Handbook of Discrete and Computational Geometry, J. Goodman and J. O’Rouke, eds., CRC Press, 1997, ch. 29.
24. N. E. Mnëv, The universality theorems on the classification problem of configuration varieties and convex polytopes varieties, in Topology and Geometry - Rohlin Seminar, O. Y. Viro, ed., no. 1346 in Lecture Notes in Mathematics, Springer- Verlag, 1988, pp. 527 - 543.
25. T. S. Motzkin, Beiträge zur Theorie der Linearen Ungleichungen, PhD thesis, Basel, 1933.
26. M. Parker, A set covering approach to infeasibility analysis of linear programming problems and related issues, PhD thesis, Dep. of Mathematics, University of Colorado at Denver, 1995.
27. M. Parker and J. Ryan, Finding the minimum weight IIS cover of an infeasible system of linear inequalities, Annals of Mathematics and Artificial Intelligence, 17 (1996), pp. 107-126.
28. J. Richter-Gebert, Realization Spaces of Polytopes, no. 1643 in Lecture Notes in Mathematics, Springer-Verlag, 1996.
29. J. Ryan, Transversals of IIS-hypergraphs, Congressus Numerantium, 81 (1991), pp. 17-22.
30. J. Ryan, IlS-hypergraphs, SIAM J. Disc. Math., 9 (1996), pp. 643-653.
31. G. M. Ziegler, Lectures on Polytopes, Springer-Verlag, 1994.