A finiteness proof for modified dantzig cuts in integer programming
- 1 September 1970
- journal article
- research article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 17 (3) , 309-313
- https://doi.org/10.1002/nav.3800170307
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Generalized Cuts in Diophantine ProgrammingManagement Science, 1966
- On the convergence of an integer‐programming processNaval Research Logistics Quarterly, 1963
- Note on solving linear programs in integersNaval Research Logistics Quarterly, 1959