Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Artificial Intelligence
Reference22 articles.
1. E. Amaldi and V. Kann, The complexity and approximability of finding maximum feasible subsystems of linear relations,Theor. Comp. Sci. 147 (1995) 181–210.
2. E. Amaldi and V. Kann, On the approximability of finding maximum feasible subsystems of linear systems,Proc. 11th Symp. on Theoretical Aspects of Computer Science (STACS'94), Lecture Notes in Computer Science (Springer, 1994), pp. 521–532.
3. E. Amaldi and V. Kann, On the approximability of removing the smallest number of relations from linear systems to achieve feasibility, Working Paper ORWP-94-6, École Polytechnique Fédérale de Lausanne, Département de Mathématiques (1994).
4. G. Brown and G. Graves, Elastic programming: A new approach to large-scale mixed integer optimization,ORSA/TIMS Conf., Las Vegas (1975).
5. N. Chakravarti, Some results concerning post-infeasibility analysis,Eur. J. Oper. Res. 73 (1994) 139–143.
Cited by
37 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献