1. Arnaldi, E. and V. Kann: The Complexity and Approximability of Finding Maximum Feasible Subsystems of Linear Relations, Theoretical Computer Science, to appear.
2. Arnaldi, E. and V. Kann: On the Approximability of Finding Maximum Feasible Subsystems of Linear Systems, In Proceedings of the 11th Symposium on Theoretical Aspects of Computer Science (STACS’94), Lecture Notes in Computer Science, P. Enjalbert, E. Mayr, K.W. Wagner (eds.), Springer-Verlag, 1994, 521–532.
3. Working Paper ORWP-94–6;E Arnaldi,1994
4. Bordetski, A.B., and L.S. Kazarinov: Determining the Committee of a System of Weighted Inequalities, Cybernetics Ukraine Academy of Science 6(1982)766–772.
5. Brown, G. and G. Graves: Elastic Programming: A New Approach to Large-Scale Mixed Integer Optimization, presented at ORSA/TIMS Conference, Las Vegas (1975).