An advanced dual algorithm with constraint relaxation for all‐integer programming
- 1 March 1983
- journal article
- research article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 30 (1) , 133-143
- https://doi.org/10.1002/nav.3800300110
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- A primal‐dual cutting‐plane algorithm for all‐integer programmingNaval Research Logistics Quarterly, 1981
- A Bound-and-Scan Algorithm for Pure Integer Linear Programming with General VariablesOperations Research, 1969
- Integer Linear Programming: A Study in Computational EfficiencyManagement Science, 1969
- A Simplified Primal (All-Integer) Integer Programming AlgorithmOperations Research, 1968