Author:
Amaldi Edoardo,Pfetsch Marc E.,Trotter Leslie E.
Publisher
Springer Berlin Heidelberg
Reference31 articles.
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 feed-forward 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. —, 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.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献