1. Applications of combinatorial methods in mathematical programming: Abstracts and open problems;Bachem,1985
2. The complexity of theorem proving procedures;Cook,1971
3. Computers and Intractability: A Guide to the Theory of NP-completeness;Garey,1979
4. D.G. Luenberser, Linear and Noniinear Programming, 2nd ed., Addison-Wesley, Reading, MA.
5. Second-order conditions for constrained minima;McCormick;SIAM J. of Applied Mathematics,1967