Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. E. Balas, “On the set covering problem”, Paper presented at the Nato Advanced Study Institute, Figueira da Foz, Portugal (May 1972).
2. E.M.L. Beale and R.E. Small, “Mixed integer programming by a branch and bound technique”, in: W.A. Kalerick, ed., Proceedings of the IFIP congress (Spartan Press, East Lansing, Mi. 1965).
3. E.M.L. Beale and J.A. Tomlin, “An integer programming approach to a class of combinatorial problems”, Mathematical Programming 1 (1972) 339–344.
4. M. Benichou, J.M. Gauthier, P. Girodet, G. Hentges, G. Ribiere and O. Vincent, “Experiments in mixed integer linear programming”, paper presented at the 7th International Symposium on mathematical programming, The Hague, Holland, September 1970.
5. R.J. Dakin, “A tree search algorithm for mixed integer linear programming problems”, The Computer Journal 8 (1965) 250–255.
Cited by
60 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献