Subject
Management Science and Operations Research,Computer Science Applications,Theoretical Computer Science
Reference30 articles.
1. 1. BALAS E. B., Intersection n-cuts-a new type of cutting planes for integer programming, Operat. Research, 1971, 19, p. 19-39.0219.90035
2. 2. BAUER F. L., Algorithms 153 Gomory; Comunications of the ACM, 1963, 6, p. 68.
3. 3. BIXBY R. et CUNNINGHAM W., Converting linear programs to network problems; Maths of Operat. Research, 1980, 5, p. 321-357.5948490442.90095
4. 4. BOWMAN V. J. et NEMHAUSER G. L., A finiteness proof for modified Dantzig cuts in integer programming: Naval Research Log Quarter, 1970, 17, p. 309-313.2758740215.59001
5. 5. BOWMAN V. J. et NEMHAUSER G. L., Deep cuts in integer programming; Operat Research, 1971, 8, p. 89-111.312902
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献