A computational comparison of gomory and knapsack cuts
- 1 January 1987
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 14 (6) , 449-456
- https://doi.org/10.1016/0305-0548(87)90041-4
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Solving Large-Scale Zero-One Linear Programming ProblemsOperations Research, 1983
- Integer Programming Post-Optimal Analysis with Cutting PlanesManagement Science, 1979
- Development of a Parametric Generating Procedure for Integer Programming Test ProblemsJournal of the ACM, 1977
- Facets of the knapsack polytopeMathematical Programming, 1975
- Integer Linear Programming: A Study in Computational EfficiencyManagement Science, 1969