Publisher
Springer International Publishing
Reference27 articles.
1. E. Amaldi, V. Kann, The complexity and approximability of finding maximum feasible subsystems of linear relations. Theor. Comput. Sci. 147, 181–210 (1995)
2. J.W. Chinneck, Formulating processing network models: viability theory. Naval Res. Logist. 37, 245–261 (1990)
3. J.W. Chinneck, Feasibility and Infeasibility in Optimization: Algorithms and Computational Methods, International Series in Operations Research and Management Sciences (Springer Science+Business Media, LLC, New York, 2008)
4. J.W. Chinneck, E.W. Dravnieks, Locating minimal infeasible constraint sets in linear programs. ORSA J. Comput. 3, 157–168 (1991)
5. L.R. Ford, D.R. Fulkerson, Flows in Networks (Princeton University Press, Princeton, 1962)